./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-84.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-250_file-84.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 6ec6051bf33a15e9801346cc4ecd6a0b29081514a3565e91db18e7f838fe18c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:47:59,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:47:59,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:47:59,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:47:59,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:47:59,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:47:59,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:47:59,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:47:59,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:47:59,226 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:47:59,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:47:59,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:47:59,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:47:59,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:47:59,228 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:47:59,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:47:59,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:47:59,228 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:47:59,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:47:59,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:47:59,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:47:59,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:47:59,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:47:59,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:47:59,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:47:59,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:47:59,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:47:59,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:47:59,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:47:59,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:47:59,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:47:59,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:47:59,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:47:59,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:47:59,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:47:59,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:47:59,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:47:59,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:47:59,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:47:59,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:47:59,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:47:59,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:47:59,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:47:59,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:47:59,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:47:59,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:47:59,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:47:59,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:47:59,231 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 -> 6ec6051bf33a15e9801346cc4ecd6a0b29081514a3565e91db18e7f838fe18c5 [2025-01-09 09:47:59,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:47:59,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:47:59,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:47:59,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:47:59,468 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:47:59,469 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-250_file-84.i [2025-01-09 09:48:00,691 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e2e6fbe/6b44d2002b264885861569630a661e00/FLAG2ddd61154 [2025-01-09 09:48:01,032 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:48:01,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-84.i [2025-01-09 09:48:01,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e2e6fbe/6b44d2002b264885861569630a661e00/FLAG2ddd61154 [2025-01-09 09:48:01,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e2e6fbe/6b44d2002b264885861569630a661e00 [2025-01-09 09:48:01,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:48:01,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:48:01,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:01,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:48:01,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:48:01,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc8c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01, skipping insertion in model container [2025-01-09 09:48:01,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:48:01,166 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-250_file-84.i[916,929] [2025-01-09 09:48:01,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:01,263 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:48:01,270 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-250_file-84.i[916,929] [2025-01-09 09:48:01,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:01,336 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:48:01,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01 WrapperNode [2025-01-09 09:48:01,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:01,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:01,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:48:01,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:48:01,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,392 INFO L138 Inliner]: procedures = 26, calls = 122, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 686 [2025-01-09 09:48:01,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:01,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:48:01,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:48:01,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:48:01,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,423 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 09:48:01,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:48:01,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:48:01,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:48:01,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:48:01,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (1/1) ... [2025-01-09 09:48:01,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:01,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:01,478 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 09:48:01,480 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 09:48:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:48:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:48:01,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:48:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:48:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:48:01,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:48:01,578 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:48:01,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:48:02,342 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 09:48:02,343 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:48:02,354 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:48:02,354 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:48:02,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:02 BoogieIcfgContainer [2025-01-09 09:48:02,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:48:02,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:48:02,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:48:02,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:48:02,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:48:01" (1/3) ... [2025-01-09 09:48:02,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1697d04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:02, skipping insertion in model container [2025-01-09 09:48:02,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:01" (2/3) ... [2025-01-09 09:48:02,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1697d04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:02, skipping insertion in model container [2025-01-09 09:48:02,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:02" (3/3) ... [2025-01-09 09:48:02,363 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-84.i [2025-01-09 09:48:02,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:48:02,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-84.i that has 2 procedures, 287 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:48:02,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:48:02,446 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;@146105ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:48:02,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:48:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 287 states, 175 states have (on average 1.4742857142857142) internal successors, (258), 176 states have internal predecessors, (258), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 09:48:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 09:48:02,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:02,479 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:02,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:02,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1879740027, now seen corresponding path program 1 times [2025-01-09 09:48:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:02,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613704309] [2025-01-09 09:48:02,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:02,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:02,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 09:48:02,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 09:48:02,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:02,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2025-01-09 09:48:03,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:03,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613704309] [2025-01-09 09:48:03,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613704309] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:03,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631685934] [2025-01-09 09:48:03,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:03,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:03,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:03,058 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 09:48:03,061 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 09:48:03,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 09:48:03,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 09:48:03,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:03,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:03,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:48:03,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2025-01-09 09:48:03,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:48:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631685934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:03,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:48:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:48:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116701114] [2025-01-09 09:48:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:03,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:48:03,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:03,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:48:03,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:48:03,430 INFO L87 Difference]: Start difference. First operand has 287 states, 175 states have (on average 1.4742857142857142) internal successors, (258), 176 states have internal predecessors, (258), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) [2025-01-09 09:48:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:03,471 INFO L93 Difference]: Finished difference Result 568 states and 1056 transitions. [2025-01-09 09:48:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:48:03,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) Word has length 661 [2025-01-09 09:48:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:03,483 INFO L225 Difference]: With dead ends: 568 [2025-01-09 09:48:03,483 INFO L226 Difference]: Without dead ends: 284 [2025-01-09 09:48:03,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 662 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 09:48:03,493 INFO L435 NwaCegarLoop]: 471 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, 471 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 09:48:03,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-09 09:48:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-01-09 09:48:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 173 states have (on average 1.4624277456647399) internal successors, (253), 173 states have internal predecessors, (253), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 09:48:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 471 transitions. [2025-01-09 09:48:03,588 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 471 transitions. Word has length 661 [2025-01-09 09:48:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:03,590 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 471 transitions. [2025-01-09 09:48:03,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) [2025-01-09 09:48:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 471 transitions. [2025-01-09 09:48:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 09:48:03,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:03,602 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:03,610 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 09:48:03,802 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 09:48:03,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:03,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash 907807229, now seen corresponding path program 1 times [2025-01-09 09:48:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:03,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102888060] [2025-01-09 09:48:03,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:03,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 09:48:03,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 09:48:03,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:03,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:04,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:04,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102888060] [2025-01-09 09:48:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102888060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:04,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:04,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445178409] [2025-01-09 09:48:04,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:04,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:04,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:04,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:04,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:04,610 INFO L87 Difference]: Start difference. First operand 284 states and 471 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:04,702 INFO L93 Difference]: Finished difference Result 748 states and 1241 transitions. [2025-01-09 09:48:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:04,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 661 [2025-01-09 09:48:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:04,711 INFO L225 Difference]: With dead ends: 748 [2025-01-09 09:48:04,713 INFO L226 Difference]: Without dead ends: 467 [2025-01-09 09:48:04,714 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 09:48:04,715 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 297 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:04,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1051 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-01-09 09:48:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 464. [2025-01-09 09:48:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 303 states have (on average 1.4917491749174918) internal successors, (452), 304 states have internal predecessors, (452), 158 states have call successors, (158), 2 states have call predecessors, (158), 2 states have return successors, (158), 157 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 09:48:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 768 transitions. [2025-01-09 09:48:04,782 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 768 transitions. Word has length 661 [2025-01-09 09:48:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:04,783 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 768 transitions. [2025-01-09 09:48:04,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 768 transitions. [2025-01-09 09:48:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-01-09 09:48:04,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:04,787 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:04,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:48:04,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:04,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash 892288511, now seen corresponding path program 1 times [2025-01-09 09:48:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:04,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466829555] [2025-01-09 09:48:04,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:04,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:04,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-01-09 09:48:04,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-01-09 09:48:04,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:04,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:05,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466829555] [2025-01-09 09:48:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466829555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:05,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:05,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698411885] [2025-01-09 09:48:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:05,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:05,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:05,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:05,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:05,114 INFO L87 Difference]: Start difference. First operand 464 states and 768 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:05,196 INFO L93 Difference]: Finished difference Result 1258 states and 2074 transitions. [2025-01-09 09:48:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 661 [2025-01-09 09:48:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:05,215 INFO L225 Difference]: With dead ends: 1258 [2025-01-09 09:48:05,215 INFO L226 Difference]: Without dead ends: 797 [2025-01-09 09:48:05,217 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 09:48:05,217 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 305 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:05,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 919 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-01-09 09:48:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 794. [2025-01-09 09:48:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 505 states have (on average 1.4554455445544554) internal successors, (735), 508 states have internal predecessors, (735), 284 states have call successors, (284), 4 states have call predecessors, (284), 4 states have return successors, (284), 281 states have call predecessors, (284), 284 states have call successors, (284) [2025-01-09 09:48:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1303 transitions. [2025-01-09 09:48:05,304 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1303 transitions. Word has length 661 [2025-01-09 09:48:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:05,305 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1303 transitions. [2025-01-09 09:48:05,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1303 transitions. [2025-01-09 09:48:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 09:48:05,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:05,311 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:48:05,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:05,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash 414626257, now seen corresponding path program 1 times [2025-01-09 09:48:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:05,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128866091] [2025-01-09 09:48:05,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:05,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 09:48:05,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 09:48:05,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:05,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:05,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:05,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128866091] [2025-01-09 09:48:05,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128866091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:05,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:05,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:05,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217685934] [2025-01-09 09:48:05,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:05,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:05,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:05,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:05,803 INFO L87 Difference]: Start difference. First operand 794 states and 1303 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:05,903 INFO L93 Difference]: Finished difference Result 2376 states and 3903 transitions. [2025-01-09 09:48:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:05,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 663 [2025-01-09 09:48:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:05,920 INFO L225 Difference]: With dead ends: 2376 [2025-01-09 09:48:05,920 INFO L226 Difference]: Without dead ends: 1585 [2025-01-09 09:48:05,925 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 09:48:05,927 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 278 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:05,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 935 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-01-09 09:48:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1583. [2025-01-09 09:48:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1006 states have (on average 1.4532803180914513) internal successors, (1462), 1012 states have internal predecessors, (1462), 568 states have call successors, (568), 8 states have call predecessors, (568), 8 states have return successors, (568), 562 states have call predecessors, (568), 568 states have call successors, (568) [2025-01-09 09:48:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2598 transitions. [2025-01-09 09:48:06,161 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2598 transitions. Word has length 663 [2025-01-09 09:48:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:06,163 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2598 transitions. [2025-01-09 09:48:06,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2598 transitions. [2025-01-09 09:48:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 09:48:06,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:06,170 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:06,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:48:06,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:06,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash 20259471, now seen corresponding path program 1 times [2025-01-09 09:48:06,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:06,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015930794] [2025-01-09 09:48:06,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:06,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:06,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 09:48:06,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 09:48:06,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:06,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015930794] [2025-01-09 09:48:06,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015930794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:06,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:06,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:06,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494374382] [2025-01-09 09:48:06,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:06,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:06,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:06,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:06,836 INFO L87 Difference]: Start difference. First operand 1583 states and 2598 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:06,980 INFO L93 Difference]: Finished difference Result 4743 states and 7788 transitions. [2025-01-09 09:48:06,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:06,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 663 [2025-01-09 09:48:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:07,001 INFO L225 Difference]: With dead ends: 4743 [2025-01-09 09:48:07,001 INFO L226 Difference]: Without dead ends: 3163 [2025-01-09 09:48:07,007 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 09:48:07,008 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 267 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:07,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 935 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2025-01-09 09:48:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3161. [2025-01-09 09:48:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 2008 states have (on average 1.450199203187251) internal successors, (2912), 2020 states have internal predecessors, (2912), 1136 states have call successors, (1136), 16 states have call predecessors, (1136), 16 states have return successors, (1136), 1124 states have call predecessors, (1136), 1136 states have call successors, (1136) [2025-01-09 09:48:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 5184 transitions. [2025-01-09 09:48:07,348 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 5184 transitions. Word has length 663 [2025-01-09 09:48:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:07,350 INFO L471 AbstractCegarLoop]: Abstraction has 3161 states and 5184 transitions. [2025-01-09 09:48:07,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 5184 transitions. [2025-01-09 09:48:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 09:48:07,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:07,360 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:07,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:48:07,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 160808081, now seen corresponding path program 1 times [2025-01-09 09:48:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:07,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774735018] [2025-01-09 09:48:07,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:07,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 09:48:07,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 09:48:07,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:07,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:08,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:08,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774735018] [2025-01-09 09:48:08,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774735018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:08,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:08,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318975410] [2025-01-09 09:48:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:08,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:08,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:08,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:08,055 INFO L87 Difference]: Start difference. First operand 3161 states and 5184 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:08,192 INFO L93 Difference]: Finished difference Result 6319 states and 10365 transitions. [2025-01-09 09:48:08,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:08,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 663 [2025-01-09 09:48:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:08,211 INFO L225 Difference]: With dead ends: 6319 [2025-01-09 09:48:08,212 INFO L226 Difference]: Without dead ends: 3161 [2025-01-09 09:48:08,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:08,221 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 468 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 467 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 09:48:08,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 467 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2025-01-09 09:48:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 3161. [2025-01-09 09:48:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 2008 states have (on average 1.4422310756972112) internal successors, (2896), 2020 states have internal predecessors, (2896), 1136 states have call successors, (1136), 16 states have call predecessors, (1136), 16 states have return successors, (1136), 1124 states have call predecessors, (1136), 1136 states have call successors, (1136) [2025-01-09 09:48:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 5168 transitions. [2025-01-09 09:48:08,506 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 5168 transitions. Word has length 663 [2025-01-09 09:48:08,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:08,508 INFO L471 AbstractCegarLoop]: Abstraction has 3161 states and 5168 transitions. [2025-01-09 09:48:08,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 5168 transitions. [2025-01-09 09:48:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-01-09 09:48:08,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:08,513 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:08,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:48:08,513 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:08,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash 418973519, now seen corresponding path program 1 times [2025-01-09 09:48:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:08,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751304588] [2025-01-09 09:48:08,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:08,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:08,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-01-09 09:48:08,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-01-09 09:48:08,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:08,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:11,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:11,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751304588] [2025-01-09 09:48:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751304588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:11,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:11,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:48:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516033206] [2025-01-09 09:48:11,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:11,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:48:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:11,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:48:11,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:48:11,514 INFO L87 Difference]: Start difference. First operand 3161 states and 5168 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:12,418 INFO L93 Difference]: Finished difference Result 6849 states and 11054 transitions. [2025-01-09 09:48:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:48:12,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 663 [2025-01-09 09:48:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:12,442 INFO L225 Difference]: With dead ends: 6849 [2025-01-09 09:48:12,442 INFO L226 Difference]: Without dead ends: 3691 [2025-01-09 09:48:12,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:48:12,454 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 41 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:12,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2219 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:48:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2025-01-09 09:48:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3673. [2025-01-09 09:48:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3673 states, 2440 states have (on average 1.4163934426229507) internal successors, (3456), 2468 states have internal predecessors, (3456), 1200 states have call successors, (1200), 32 states have call predecessors, (1200), 32 states have return successors, (1200), 1172 states have call predecessors, (1200), 1200 states have call successors, (1200) [2025-01-09 09:48:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 5856 transitions. [2025-01-09 09:48:12,757 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 5856 transitions. Word has length 663 [2025-01-09 09:48:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:12,758 INFO L471 AbstractCegarLoop]: Abstraction has 3673 states and 5856 transitions. [2025-01-09 09:48:12,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 5856 transitions. [2025-01-09 09:48:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-09 09:48:12,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:12,770 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:12,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:48:12,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:12,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash -921620282, now seen corresponding path program 1 times [2025-01-09 09:48:12,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:12,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114628119] [2025-01-09 09:48:12,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:12,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:12,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 09:48:12,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 09:48:12,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:12,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114628119] [2025-01-09 09:48:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114628119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:13,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:48:13,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291524348] [2025-01-09 09:48:13,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:13,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:48:13,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:13,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:48:13,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:48:13,662 INFO L87 Difference]: Start difference. First operand 3673 states and 5856 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:14,013 INFO L93 Difference]: Finished difference Result 7834 states and 12360 transitions. [2025-01-09 09:48:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:48:14,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 664 [2025-01-09 09:48:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:14,043 INFO L225 Difference]: With dead ends: 7834 [2025-01-09 09:48:14,043 INFO L226 Difference]: Without dead ends: 4164 [2025-01-09 09:48:14,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:48:14,059 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 72 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:14,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1847 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:48:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4164 states. [2025-01-09 09:48:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4164 to 4145. [2025-01-09 09:48:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4145 states, 2861 states have (on average 1.399860188745194) internal successors, (4005), 2906 states have internal predecessors, (4005), 1234 states have call successors, (1234), 49 states have call predecessors, (1234), 49 states have return successors, (1234), 1189 states have call predecessors, (1234), 1234 states have call successors, (1234) [2025-01-09 09:48:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 6473 transitions. [2025-01-09 09:48:14,479 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 6473 transitions. Word has length 664 [2025-01-09 09:48:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:14,480 INFO L471 AbstractCegarLoop]: Abstraction has 4145 states and 6473 transitions. [2025-01-09 09:48:14,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 6473 transitions. [2025-01-09 09:48:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-09 09:48:14,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:14,491 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:14,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:48:14,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:14,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash 89496968, now seen corresponding path program 1 times [2025-01-09 09:48:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:14,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915604500] [2025-01-09 09:48:14,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:14,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 09:48:14,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 09:48:14,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:14,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:14,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:14,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915604500] [2025-01-09 09:48:14,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915604500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:14,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:14,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:14,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951640620] [2025-01-09 09:48:14,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:14,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:14,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:14,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:14,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:14,958 INFO L87 Difference]: Start difference. First operand 4145 states and 6473 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:15,510 INFO L93 Difference]: Finished difference Result 10910 states and 17108 transitions. [2025-01-09 09:48:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:48:15,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 664 [2025-01-09 09:48:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:15,573 INFO L225 Difference]: With dead ends: 10910 [2025-01-09 09:48:15,573 INFO L226 Difference]: Without dead ends: 6776 [2025-01-09 09:48:15,592 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 09:48:15,594 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 906 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:15,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 2226 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:48:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6776 states. [2025-01-09 09:48:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6776 to 4267. [2025-01-09 09:48:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 2906 states have (on average 1.390915347556779) internal successors, (4042), 2951 states have internal predecessors, (4042), 1309 states have call successors, (1309), 51 states have call predecessors, (1309), 51 states have return successors, (1309), 1264 states have call predecessors, (1309), 1309 states have call successors, (1309) [2025-01-09 09:48:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 6660 transitions. [2025-01-09 09:48:16,068 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 6660 transitions. Word has length 664 [2025-01-09 09:48:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:16,069 INFO L471 AbstractCegarLoop]: Abstraction has 4267 states and 6660 transitions. [2025-01-09 09:48:16,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 6660 transitions. [2025-01-09 09:48:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-09 09:48:16,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:16,074 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:16,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:48:16,075 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:16,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1715941366, now seen corresponding path program 1 times [2025-01-09 09:48:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:16,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571095535] [2025-01-09 09:48:16,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:16,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:16,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 09:48:16,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 09:48:16,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:16,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:17,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571095535] [2025-01-09 09:48:17,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571095535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:17,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:17,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:48:17,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936485041] [2025-01-09 09:48:17,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:17,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:48:17,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:17,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:48:17,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:48:17,153 INFO L87 Difference]: Start difference. First operand 4267 states and 6660 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:17,446 INFO L93 Difference]: Finished difference Result 8483 states and 13178 transitions. [2025-01-09 09:48:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:48:17,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 664 [2025-01-09 09:48:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:17,465 INFO L225 Difference]: With dead ends: 8483 [2025-01-09 09:48:17,465 INFO L226 Difference]: Without dead ends: 4349 [2025-01-09 09:48:17,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:48:17,474 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 68 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:17,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1883 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:48:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4349 states. [2025-01-09 09:48:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4349 to 3867. [2025-01-09 09:48:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3867 states, 2538 states have (on average 1.3908589440504333) internal successors, (3530), 2567 states have internal predecessors, (3530), 1277 states have call successors, (1277), 51 states have call predecessors, (1277), 51 states have return successors, (1277), 1248 states have call predecessors, (1277), 1277 states have call successors, (1277) [2025-01-09 09:48:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3867 states and 6084 transitions. [2025-01-09 09:48:17,867 INFO L78 Accepts]: Start accepts. Automaton has 3867 states and 6084 transitions. Word has length 664 [2025-01-09 09:48:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:17,868 INFO L471 AbstractCegarLoop]: Abstraction has 3867 states and 6084 transitions. [2025-01-09 09:48:17,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3867 states and 6084 transitions. [2025-01-09 09:48:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-01-09 09:48:17,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:17,877 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:17,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:48:17,877 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:17,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1436536760, now seen corresponding path program 1 times [2025-01-09 09:48:17,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:17,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466099942] [2025-01-09 09:48:17,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:17,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:17,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-01-09 09:48:18,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-01-09 09:48:18,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:18,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466099942] [2025-01-09 09:48:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466099942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:20,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:20,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:48:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627986277] [2025-01-09 09:48:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:20,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:48:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:20,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:48:20,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:48:20,926 INFO L87 Difference]: Start difference. First operand 3867 states and 6084 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:21,789 INFO L93 Difference]: Finished difference Result 9703 states and 14860 transitions. [2025-01-09 09:48:21,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:48:21,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 665 [2025-01-09 09:48:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:21,809 INFO L225 Difference]: With dead ends: 9703 [2025-01-09 09:48:21,809 INFO L226 Difference]: Without dead ends: 5969 [2025-01-09 09:48:21,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:48:21,819 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 85 mSDsluCounter, 2999 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 3448 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:21,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 3448 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:48:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2025-01-09 09:48:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 4363. [2025-01-09 09:48:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4363 states, 3034 states have (on average 1.3902439024390243) internal successors, (4218), 3063 states have internal predecessors, (4218), 1277 states have call successors, (1277), 51 states have call predecessors, (1277), 51 states have return successors, (1277), 1248 states have call predecessors, (1277), 1277 states have call successors, (1277) [2025-01-09 09:48:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4363 states to 4363 states and 6772 transitions. [2025-01-09 09:48:22,110 INFO L78 Accepts]: Start accepts. Automaton has 4363 states and 6772 transitions. Word has length 665 [2025-01-09 09:48:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:22,110 INFO L471 AbstractCegarLoop]: Abstraction has 4363 states and 6772 transitions. [2025-01-09 09:48:22,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4363 states and 6772 transitions. [2025-01-09 09:48:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-01-09 09:48:22,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:22,116 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:22,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:48:22,117 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:22,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:22,118 INFO L85 PathProgramCache]: Analyzing trace with hash -735472182, now seen corresponding path program 1 times [2025-01-09 09:48:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:22,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122087021] [2025-01-09 09:48:22,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:22,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-01-09 09:48:22,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-01-09 09:48:22,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:22,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:24,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:24,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122087021] [2025-01-09 09:48:24,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122087021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:24,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:24,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:48:24,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167565140] [2025-01-09 09:48:24,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:24,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:48:24,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:24,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:48:24,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:48:24,351 INFO L87 Difference]: Start difference. First operand 4363 states and 6772 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:25,401 INFO L93 Difference]: Finished difference Result 9845 states and 15035 transitions. [2025-01-09 09:48:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 09:48:25,402 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 665 [2025-01-09 09:48:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:25,435 INFO L225 Difference]: With dead ends: 9845 [2025-01-09 09:48:25,436 INFO L226 Difference]: Without dead ends: 5615 [2025-01-09 09:48:25,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:48:25,456 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 61 mSDsluCounter, 3000 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:25,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3445 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:48:25,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5615 states. [2025-01-09 09:48:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5615 to 4363. [2025-01-09 09:48:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4363 states, 3034 states have (on average 1.3902439024390243) internal successors, (4218), 3063 states have internal predecessors, (4218), 1277 states have call successors, (1277), 51 states have call predecessors, (1277), 51 states have return successors, (1277), 1248 states have call predecessors, (1277), 1277 states have call successors, (1277) [2025-01-09 09:48:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4363 states to 4363 states and 6772 transitions. [2025-01-09 09:48:25,964 INFO L78 Accepts]: Start accepts. Automaton has 4363 states and 6772 transitions. Word has length 665 [2025-01-09 09:48:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:25,968 INFO L471 AbstractCegarLoop]: Abstraction has 4363 states and 6772 transitions. [2025-01-09 09:48:25,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4363 states and 6772 transitions. [2025-01-09 09:48:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-01-09 09:48:25,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:25,977 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:25,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:48:25,977 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:25,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash -849730746, now seen corresponding path program 1 times [2025-01-09 09:48:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290710974] [2025-01-09 09:48:25,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:26,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-01-09 09:48:26,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-01-09 09:48:26,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:26,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:30,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290710974] [2025-01-09 09:48:30,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290710974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:30,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:30,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:48:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249524983] [2025-01-09 09:48:30,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:30,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:48:30,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:30,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:48:30,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:48:30,548 INFO L87 Difference]: Start difference. First operand 4363 states and 6772 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:32,038 INFO L93 Difference]: Finished difference Result 10037 states and 15259 transitions. [2025-01-09 09:48:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:48:32,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 665 [2025-01-09 09:48:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:32,058 INFO L225 Difference]: With dead ends: 10037 [2025-01-09 09:48:32,058 INFO L226 Difference]: Without dead ends: 5807 [2025-01-09 09:48:32,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:48:32,067 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 72 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:32,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 3039 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:48:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5807 states. [2025-01-09 09:48:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5807 to 4427. [2025-01-09 09:48:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4427 states, 3098 states have (on average 1.3925112976113623) internal successors, (4314), 3127 states have internal predecessors, (4314), 1277 states have call successors, (1277), 51 states have call predecessors, (1277), 51 states have return successors, (1277), 1248 states have call predecessors, (1277), 1277 states have call successors, (1277) [2025-01-09 09:48:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 6868 transitions. [2025-01-09 09:48:32,518 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 6868 transitions. Word has length 665 [2025-01-09 09:48:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:32,519 INFO L471 AbstractCegarLoop]: Abstraction has 4427 states and 6868 transitions. [2025-01-09 09:48:32,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 6868 transitions. [2025-01-09 09:48:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-01-09 09:48:32,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:32,525 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:32,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:48:32,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:32,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash -148666168, now seen corresponding path program 1 times [2025-01-09 09:48:32,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:32,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480085545] [2025-01-09 09:48:32,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:32,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:32,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-01-09 09:48:32,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-01-09 09:48:32,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:32,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:37,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480085545] [2025-01-09 09:48:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480085545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:37,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:37,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:48:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715695709] [2025-01-09 09:48:37,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:37,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:48:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:37,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:48:37,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:48:37,511 INFO L87 Difference]: Start difference. First operand 4427 states and 6868 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:39,223 INFO L93 Difference]: Finished difference Result 10005 states and 15227 transitions. [2025-01-09 09:48:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 09:48:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 665 [2025-01-09 09:48:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:39,242 INFO L225 Difference]: With dead ends: 10005 [2025-01-09 09:48:39,243 INFO L226 Difference]: Without dead ends: 5711 [2025-01-09 09:48:39,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:48:39,250 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 119 mSDsluCounter, 3426 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:39,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 3873 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:48:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2025-01-09 09:48:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 4363. [2025-01-09 09:48:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4363 states, 3034 states have (on average 1.3902439024390243) internal successors, (4218), 3063 states have internal predecessors, (4218), 1277 states have call successors, (1277), 51 states have call predecessors, (1277), 51 states have return successors, (1277), 1248 states have call predecessors, (1277), 1277 states have call successors, (1277) [2025-01-09 09:48:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4363 states to 4363 states and 6772 transitions. [2025-01-09 09:48:39,578 INFO L78 Accepts]: Start accepts. Automaton has 4363 states and 6772 transitions. Word has length 665 [2025-01-09 09:48:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:39,579 INFO L471 AbstractCegarLoop]: Abstraction has 4363 states and 6772 transitions. [2025-01-09 09:48:39,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4363 states and 6772 transitions. [2025-01-09 09:48:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-01-09 09:48:39,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:39,584 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:39,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:48:39,585 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:39,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash -799306363, now seen corresponding path program 1 times [2025-01-09 09:48:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:39,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277126745] [2025-01-09 09:48:39,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:39,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:39,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 09:48:39,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 09:48:39,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:39,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277126745] [2025-01-09 09:48:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277126745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013647783] [2025-01-09 09:48:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:39,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:39,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:39,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:39,716 INFO L87 Difference]: Start difference. First operand 4363 states and 6772 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:40,069 INFO L93 Difference]: Finished difference Result 9635 states and 14730 transitions. [2025-01-09 09:48:40,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 666 [2025-01-09 09:48:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:40,092 INFO L225 Difference]: With dead ends: 9635 [2025-01-09 09:48:40,092 INFO L226 Difference]: Without dead ends: 5405 [2025-01-09 09:48:40,102 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 09:48:40,102 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 39 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:40,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 883 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:48:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2025-01-09 09:48:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 5067. [2025-01-09 09:48:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5067 states, 3690 states have (on average 1.37289972899729) internal successors, (5066), 3735 states have internal predecessors, (5066), 1309 states have call successors, (1309), 67 states have call predecessors, (1309), 67 states have return successors, (1309), 1264 states have call predecessors, (1309), 1309 states have call successors, (1309) [2025-01-09 09:48:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5067 states to 5067 states and 7684 transitions. [2025-01-09 09:48:40,488 INFO L78 Accepts]: Start accepts. Automaton has 5067 states and 7684 transitions. Word has length 666 [2025-01-09 09:48:40,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:40,489 INFO L471 AbstractCegarLoop]: Abstraction has 5067 states and 7684 transitions. [2025-01-09 09:48:40,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 7684 transitions. [2025-01-09 09:48:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-01-09 09:48:40,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:40,495 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:40,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 09:48:40,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:40,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1681111785, now seen corresponding path program 1 times [2025-01-09 09:48:40,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:40,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094200107] [2025-01-09 09:48:40,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:40,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:40,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 09:48:40,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 09:48:40,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:40,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094200107] [2025-01-09 09:48:40,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094200107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:40,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:48:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903760485] [2025-01-09 09:48:40,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:40,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:48:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:40,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:48:40,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:48:40,846 INFO L87 Difference]: Start difference. First operand 5067 states and 7684 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:41,464 INFO L93 Difference]: Finished difference Result 12242 states and 18480 transitions. [2025-01-09 09:48:41,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:48:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 666 [2025-01-09 09:48:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:41,497 INFO L225 Difference]: With dead ends: 12242 [2025-01-09 09:48:41,497 INFO L226 Difference]: Without dead ends: 7308 [2025-01-09 09:48:41,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:48:41,509 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 367 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:41,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1629 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:48:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7308 states. [2025-01-09 09:48:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7308 to 5738. [2025-01-09 09:48:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5738 states, 4328 states have (on average 1.4195933456561922) internal successors, (6144), 4372 states have internal predecessors, (6144), 1341 states have call successors, (1341), 68 states have call predecessors, (1341), 68 states have return successors, (1341), 1297 states have call predecessors, (1341), 1341 states have call successors, (1341) [2025-01-09 09:48:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5738 states to 5738 states and 8826 transitions. [2025-01-09 09:48:41,931 INFO L78 Accepts]: Start accepts. Automaton has 5738 states and 8826 transitions. Word has length 666 [2025-01-09 09:48:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:41,931 INFO L471 AbstractCegarLoop]: Abstraction has 5738 states and 8826 transitions. [2025-01-09 09:48:41,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5738 states and 8826 transitions. [2025-01-09 09:48:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-01-09 09:48:41,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:41,937 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:41,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 09:48:41,937 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:41,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1891218325, now seen corresponding path program 1 times [2025-01-09 09:48:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:41,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735798143] [2025-01-09 09:48:41,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:41,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:41,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 09:48:41,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 09:48:41,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:41,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-01-09 09:48:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:42,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735798143] [2025-01-09 09:48:42,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735798143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:42,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:42,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888572120] [2025-01-09 09:48:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:42,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:42,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:42,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:42,073 INFO L87 Difference]: Start difference. First operand 5738 states and 8826 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:42,355 INFO L93 Difference]: Finished difference Result 11074 states and 16768 transitions. [2025-01-09 09:48:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:42,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 666 [2025-01-09 09:48:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:42,374 INFO L225 Difference]: With dead ends: 11074 [2025-01-09 09:48:42,374 INFO L226 Difference]: Without dead ends: 6140 [2025-01-09 09:48:42,382 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 09:48:42,383 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 46 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:42,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 903 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:48:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6140 states. [2025-01-09 09:48:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6140 to 5498. [2025-01-09 09:48:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5498 states, 4120 states have (on average 1.4174757281553398) internal successors, (5840), 4148 states have internal predecessors, (5840), 1309 states have call successors, (1309), 68 states have call predecessors, (1309), 68 states have return successors, (1309), 1281 states have call predecessors, (1309), 1309 states have call successors, (1309) [2025-01-09 09:48:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5498 states to 5498 states and 8458 transitions. [2025-01-09 09:48:42,694 INFO L78 Accepts]: Start accepts. Automaton has 5498 states and 8458 transitions. Word has length 666 [2025-01-09 09:48:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:42,695 INFO L471 AbstractCegarLoop]: Abstraction has 5498 states and 8458 transitions. [2025-01-09 09:48:42,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-01-09 09:48:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5498 states and 8458 transitions. [2025-01-09 09:48:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-01-09 09:48:42,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:42,700 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:42,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 09:48:42,700 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:42,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:42,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1633507843, now seen corresponding path program 1 times [2025-01-09 09:48:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:42,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962321465] [2025-01-09 09:48:42,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:42,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:42,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 09:48:42,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 09:48:42,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:42,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:48:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447250909] [2025-01-09 09:48:42,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:42,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:42,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:42,957 INFO L229 MonitoredProcess]: Starting monitored process 3 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 09:48:42,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:48:43,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 09:48:43,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 09:48:43,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:43,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:43,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 09:48:43,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 14159 proven. 297 refuted. 0 times theorem prover too weak. 9088 trivial. 0 not checked. [2025-01-09 09:48:44,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:48:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 345 proven. 300 refuted. 0 times theorem prover too weak. 22899 trivial. 0 not checked. [2025-01-09 09:48:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:50,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962321465] [2025-01-09 09:48:50,398 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 09:48:50,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447250909] [2025-01-09 09:48:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447250909] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:48:50,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:48:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-01-09 09:48:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882804164] [2025-01-09 09:48:50,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:48:50,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 09:48:50,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:50,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 09:48:50,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-01-09 09:48:50,401 INFO L87 Difference]: Start difference. First operand 5498 states and 8458 transitions. Second operand has 20 states, 20 states have (on average 9.25) internal successors, (185), 20 states have internal predecessors, (185), 5 states have call successors, (166), 3 states have call predecessors, (166), 7 states have return successors, (167), 5 states have call predecessors, (167), 5 states have call successors, (167) [2025-01-09 09:48:52,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 09:48:56,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 09:49:05,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 09:49:09,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 09:49:11,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 09:49:13,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 09:49:14,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 09:49:15,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 09:49:18,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 09:49:19,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]