./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.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 4c96b2c0a4805af872684054e348cbdc2f3aecf564e5f15847ec776b279df9b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:09:39,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:09:39,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:09:39,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:09:39,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:09:39,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:09:39,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:09:39,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:09:39,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:09:39,484 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:09:39,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:09:39,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:09:39,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:09:39,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:09:39,485 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:09:39,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:09:39,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:09:39,485 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:09:39,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:09:39,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:09:39,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:09:39,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:09:39,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:39,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:39,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:09:39,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:09:39,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:09:39,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:09:39,488 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 -> 4c96b2c0a4805af872684054e348cbdc2f3aecf564e5f15847ec776b279df9b4 [2025-01-09 10:09:39,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:09:39,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:09:39,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:09:39,725 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:09:39,725 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:09:39,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i [2025-01-09 10:09:40,868 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c714c097/86d7eb07202d4804ab25c21994454dc1/FLAGf61327c3f [2025-01-09 10:09:41,187 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:09:41,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i [2025-01-09 10:09:41,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c714c097/86d7eb07202d4804ab25c21994454dc1/FLAGf61327c3f [2025-01-09 10:09:41,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c714c097/86d7eb07202d4804ab25c21994454dc1 [2025-01-09 10:09:41,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:09:41,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:09:41,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:09:41,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:09:41,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:09:41,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39718001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41, skipping insertion in model container [2025-01-09 10:09:41,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:09:41,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i[916,929] [2025-01-09 10:09:41,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:09:41,561 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:09:41,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-91.i[916,929] [2025-01-09 10:09:41,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:09:41,647 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:09:41,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41 WrapperNode [2025-01-09 10:09:41,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:09:41,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:09:41,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:09:41,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:09:41,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,755 INFO L138 Inliner]: procedures = 26, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 901 [2025-01-09 10:09:41,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:09:41,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:09:41,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:09:41,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:09:41,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,822 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:09:41,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:09:41,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:09:41,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:09:41,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:09:41,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (1/1) ... [2025-01-09 10:09:41,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:41,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:41,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:09:41,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:09:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:09:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:09:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:09:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:09:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:09:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:09:42,083 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:09:42,084 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:09:43,102 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 10:09:43,102 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:09:43,119 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:09:43,122 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:09:43,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:09:43 BoogieIcfgContainer [2025-01-09 10:09:43,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:09:43,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:09:43,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:09:43,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:09:43,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:09:41" (1/3) ... [2025-01-09 10:09:43,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad7230b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:09:43, skipping insertion in model container [2025-01-09 10:09:43,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:41" (2/3) ... [2025-01-09 10:09:43,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad7230b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:09:43, skipping insertion in model container [2025-01-09 10:09:43,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:09:43" (3/3) ... [2025-01-09 10:09:43,129 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-91.i [2025-01-09 10:09:43,138 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:09:43,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-91.i that has 2 procedures, 375 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:09:43,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:09:43,212 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;@18505299, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:09:43,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:09:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 375 states, 241 states have (on average 1.5394190871369295) internal successors, (371), 242 states have internal predecessors, (371), 131 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2025-01-09 10:09:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-01-09 10:09:43,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:43,249 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:43,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:43,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:43,257 INFO L85 PathProgramCache]: Analyzing trace with hash -687872063, now seen corresponding path program 1 times [2025-01-09 10:09:43,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:43,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430684431] [2025-01-09 10:09:43,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:43,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:43,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-01-09 10:09:43,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-01-09 10:09:43,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:43,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 33800 trivial. 0 not checked. [2025-01-09 10:09:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:43,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430684431] [2025-01-09 10:09:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430684431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:43,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662514970] [2025-01-09 10:09:43,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:43,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:43,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:43,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:09:43,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:09:44,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-01-09 10:09:44,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-01-09 10:09:44,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:44,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:44,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 1833 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:09:44,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 33800 trivial. 0 not checked. [2025-01-09 10:09:44,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:09:44,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662514970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:44,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:09:44,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:09:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893932179] [2025-01-09 10:09:44,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:44,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:09:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:44,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:09:44,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:09:44,433 INFO L87 Difference]: Start difference. First operand has 375 states, 241 states have (on average 1.5394190871369295) internal successors, (371), 242 states have internal predecessors, (371), 131 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 2 states have call successors, (131) [2025-01-09 10:09:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:44,488 INFO L93 Difference]: Finished difference Result 744 states and 1392 transitions. [2025-01-09 10:09:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:09:44,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 2 states have call successors, (131) Word has length 819 [2025-01-09 10:09:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:44,499 INFO L225 Difference]: With dead ends: 744 [2025-01-09 10:09:44,500 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 10:09:44,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:09:44,509 INFO L435 NwaCegarLoop]: 623 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, 623 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:44,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 10:09:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-01-09 10:09:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 239 states have (on average 1.5104602510460252) internal successors, (361), 239 states have internal predecessors, (361), 131 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2025-01-09 10:09:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 623 transitions. [2025-01-09 10:09:44,592 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 623 transitions. Word has length 819 [2025-01-09 10:09:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:44,592 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 623 transitions. [2025-01-09 10:09:44,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 2 states have call successors, (131) [2025-01-09 10:09:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 623 transitions. [2025-01-09 10:09:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-01-09 10:09:44,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:44,611 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:44,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:09:44,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:09:44,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:44,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:44,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1414606099, now seen corresponding path program 1 times [2025-01-09 10:09:44,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:44,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658327500] [2025-01-09 10:09:44,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:44,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:44,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-01-09 10:09:44,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-01-09 10:09:44,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:44,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:45,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:45,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658327500] [2025-01-09 10:09:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658327500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:45,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845703227] [2025-01-09 10:09:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:45,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:45,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:45,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:45,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:45,483 INFO L87 Difference]: Start difference. First operand 372 states and 623 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:45,552 INFO L93 Difference]: Finished difference Result 939 states and 1582 transitions. [2025-01-09 10:09:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:45,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 819 [2025-01-09 10:09:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:45,561 INFO L225 Difference]: With dead ends: 939 [2025-01-09 10:09:45,563 INFO L226 Difference]: Without dead ends: 570 [2025-01-09 10:09:45,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:45,565 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 325 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:45,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1297 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-01-09 10:09:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 567. [2025-01-09 10:09:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 409 states have (on average 1.5843520782396088) internal successors, (648), 410 states have internal predecessors, (648), 155 states have call successors, (155), 2 states have call predecessors, (155), 2 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 10:09:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 958 transitions. [2025-01-09 10:09:45,635 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 958 transitions. Word has length 819 [2025-01-09 10:09:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:45,638 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 958 transitions. [2025-01-09 10:09:45,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 958 transitions. [2025-01-09 10:09:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-01-09 10:09:45,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:45,651 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:45,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:09:45,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:45,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2084784361, now seen corresponding path program 1 times [2025-01-09 10:09:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:45,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429784939] [2025-01-09 10:09:45,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:45,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:45,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-01-09 10:09:45,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-01-09 10:09:45,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:45,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429784939] [2025-01-09 10:09:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429784939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:45,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:45,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852430770] [2025-01-09 10:09:45,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:45,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:45,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:45,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:45,970 INFO L87 Difference]: Start difference. First operand 567 states and 958 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:46,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:46,056 INFO L93 Difference]: Finished difference Result 1499 states and 2534 transitions. [2025-01-09 10:09:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:46,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 819 [2025-01-09 10:09:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:46,068 INFO L225 Difference]: With dead ends: 1499 [2025-01-09 10:09:46,068 INFO L226 Difference]: Without dead ends: 935 [2025-01-09 10:09:46,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:46,072 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 318 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:46,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1333 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-01-09 10:09:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 932. [2025-01-09 10:09:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 706 states have (on average 1.5991501416430596) internal successors, (1129), 709 states have internal predecessors, (1129), 221 states have call successors, (221), 4 states have call predecessors, (221), 4 states have return successors, (221), 218 states have call predecessors, (221), 221 states have call successors, (221) [2025-01-09 10:09:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1571 transitions. [2025-01-09 10:09:46,143 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1571 transitions. Word has length 819 [2025-01-09 10:09:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:46,145 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1571 transitions. [2025-01-09 10:09:46,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1571 transitions. [2025-01-09 10:09:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-01-09 10:09:46,153 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:46,154 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:46,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:09:46,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:46,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1272104723, now seen corresponding path program 1 times [2025-01-09 10:09:46,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:46,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757814624] [2025-01-09 10:09:46,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:46,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:46,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-01-09 10:09:46,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-01-09 10:09:46,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:46,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:46,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757814624] [2025-01-09 10:09:46,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757814624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:46,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:46,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256361278] [2025-01-09 10:09:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:46,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:46,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:46,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:46,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:46,591 INFO L87 Difference]: Start difference. First operand 932 states and 1571 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:46,721 INFO L93 Difference]: Finished difference Result 2461 states and 4144 transitions. [2025-01-09 10:09:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:09:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 819 [2025-01-09 10:09:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:46,733 INFO L225 Difference]: With dead ends: 2461 [2025-01-09 10:09:46,733 INFO L226 Difference]: Without dead ends: 1532 [2025-01-09 10:09:46,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:46,738 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 283 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:46,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2059 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:09:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-01-09 10:09:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1525. [2025-01-09 10:09:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1157 states have (on average 1.5903197925669836) internal successors, (1840), 1164 states have internal predecessors, (1840), 359 states have call successors, (359), 8 states have call predecessors, (359), 8 states have return successors, (359), 352 states have call predecessors, (359), 359 states have call successors, (359) [2025-01-09 10:09:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2558 transitions. [2025-01-09 10:09:46,836 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2558 transitions. Word has length 819 [2025-01-09 10:09:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:46,837 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2558 transitions. [2025-01-09 10:09:46,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2558 transitions. [2025-01-09 10:09:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2025-01-09 10:09:46,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:46,848 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:46,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:09:46,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:46,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1747107648, now seen corresponding path program 1 times [2025-01-09 10:09:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:46,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124390340] [2025-01-09 10:09:46,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:46,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 820 statements into 1 equivalence classes. [2025-01-09 10:09:46,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 820 of 820 statements. [2025-01-09 10:09:46,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:46,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124390340] [2025-01-09 10:09:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124390340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121943737] [2025-01-09 10:09:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:47,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:47,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:47,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:47,098 INFO L87 Difference]: Start difference. First operand 1525 states and 2558 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:47,243 INFO L93 Difference]: Finished difference Result 4505 states and 7552 transitions. [2025-01-09 10:09:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:47,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 820 [2025-01-09 10:09:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:47,262 INFO L225 Difference]: With dead ends: 4505 [2025-01-09 10:09:47,262 INFO L226 Difference]: Without dead ends: 2983 [2025-01-09 10:09:47,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:47,268 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 560 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:47,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1279 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-01-09 10:09:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2177. [2025-01-09 10:09:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 1809 states have (on average 1.642896627971255) internal successors, (2972), 1816 states have internal predecessors, (2972), 359 states have call successors, (359), 8 states have call predecessors, (359), 8 states have return successors, (359), 352 states have call predecessors, (359), 359 states have call successors, (359) [2025-01-09 10:09:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 3690 transitions. [2025-01-09 10:09:47,390 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 3690 transitions. Word has length 820 [2025-01-09 10:09:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:47,391 INFO L471 AbstractCegarLoop]: Abstraction has 2177 states and 3690 transitions. [2025-01-09 10:09:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 3690 transitions. [2025-01-09 10:09:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2025-01-09 10:09:47,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:47,399 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:47,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:09:47,399 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:47,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1708825986, now seen corresponding path program 1 times [2025-01-09 10:09:47,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:47,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174789424] [2025-01-09 10:09:47,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:47,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 820 statements into 1 equivalence classes. [2025-01-09 10:09:47,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 820 of 820 statements. [2025-01-09 10:09:47,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:47,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:47,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174789424] [2025-01-09 10:09:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174789424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:47,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203143449] [2025-01-09 10:09:47,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:47,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:47,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:47,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:47,765 INFO L87 Difference]: Start difference. First operand 2177 states and 3690 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:48,599 INFO L93 Difference]: Finished difference Result 7874 states and 13315 transitions. [2025-01-09 10:09:48,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:09:48,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 820 [2025-01-09 10:09:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:48,630 INFO L225 Difference]: With dead ends: 7874 [2025-01-09 10:09:48,630 INFO L226 Difference]: Without dead ends: 5700 [2025-01-09 10:09:48,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:09:48,637 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 657 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:48,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1753 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:09:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-01-09 10:09:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5695. [2025-01-09 10:09:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5695 states, 4637 states have (on average 1.626698296312271) internal successors, (7543), 4659 states have internal predecessors, (7543), 1033 states have call successors, (1033), 24 states have call predecessors, (1033), 24 states have return successors, (1033), 1011 states have call predecessors, (1033), 1033 states have call successors, (1033) [2025-01-09 10:09:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 9609 transitions. [2025-01-09 10:09:48,952 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 9609 transitions. Word has length 820 [2025-01-09 10:09:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:48,953 INFO L471 AbstractCegarLoop]: Abstraction has 5695 states and 9609 transitions. [2025-01-09 10:09:48,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 9609 transitions. [2025-01-09 10:09:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-01-09 10:09:48,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:48,963 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:48,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:09:48,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:48,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash -684493915, now seen corresponding path program 1 times [2025-01-09 10:09:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:48,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960624439] [2025-01-09 10:09:48,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:48,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:49,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-01-09 10:09:49,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-01-09 10:09:49,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:49,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:49,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:49,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960624439] [2025-01-09 10:09:49,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960624439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:49,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:49,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:49,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494258419] [2025-01-09 10:09:49,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:49,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:49,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:49,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:49,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:49,254 INFO L87 Difference]: Start difference. First operand 5695 states and 9609 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:49,547 INFO L93 Difference]: Finished difference Result 16365 states and 27620 transitions. [2025-01-09 10:09:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:49,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-01-09 10:09:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:49,601 INFO L225 Difference]: With dead ends: 16365 [2025-01-09 10:09:49,602 INFO L226 Difference]: Without dead ends: 10673 [2025-01-09 10:09:49,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:49,622 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 281 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:49,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1307 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2025-01-09 10:09:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10659. [2025-01-09 10:09:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10659 states, 8929 states have (on average 1.628737820584612) internal successors, (14543), 8975 states have internal predecessors, (14543), 1681 states have call successors, (1681), 48 states have call predecessors, (1681), 48 states have return successors, (1681), 1635 states have call predecessors, (1681), 1681 states have call successors, (1681) [2025-01-09 10:09:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10659 states to 10659 states and 17905 transitions. [2025-01-09 10:09:50,108 INFO L78 Accepts]: Start accepts. Automaton has 10659 states and 17905 transitions. Word has length 821 [2025-01-09 10:09:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:50,109 INFO L471 AbstractCegarLoop]: Abstraction has 10659 states and 17905 transitions. [2025-01-09 10:09:50,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 10659 states and 17905 transitions. [2025-01-09 10:09:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-01-09 10:09:50,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:50,124 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:50,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:09:50,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:50,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash 154539747, now seen corresponding path program 1 times [2025-01-09 10:09:50,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:50,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157458945] [2025-01-09 10:09:50,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:50,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-01-09 10:09:50,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-01-09 10:09:50,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:50,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:50,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:50,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157458945] [2025-01-09 10:09:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157458945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:50,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:50,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:50,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586003355] [2025-01-09 10:09:50,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:50,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:50,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:50,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:50,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:50,331 INFO L87 Difference]: Start difference. First operand 10659 states and 17905 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:50,622 INFO L93 Difference]: Finished difference Result 21377 states and 35856 transitions. [2025-01-09 10:09:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:50,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-01-09 10:09:50,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:50,673 INFO L225 Difference]: With dead ends: 21377 [2025-01-09 10:09:50,673 INFO L226 Difference]: Without dead ends: 10721 [2025-01-09 10:09:50,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:50,698 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 276 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:50,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1400 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10721 states. [2025-01-09 10:09:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10721 to 8703. [2025-01-09 10:09:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8703 states, 7633 states have (on average 1.6353989257172803) internal successors, (12483), 7655 states have internal predecessors, (12483), 1033 states have call successors, (1033), 36 states have call predecessors, (1033), 36 states have return successors, (1033), 1011 states have call predecessors, (1033), 1033 states have call successors, (1033) [2025-01-09 10:09:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8703 states to 8703 states and 14549 transitions. [2025-01-09 10:09:51,121 INFO L78 Accepts]: Start accepts. Automaton has 8703 states and 14549 transitions. Word has length 821 [2025-01-09 10:09:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:51,122 INFO L471 AbstractCegarLoop]: Abstraction has 8703 states and 14549 transitions. [2025-01-09 10:09:51,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 8703 states and 14549 transitions. [2025-01-09 10:09:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-01-09 10:09:51,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:51,141 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:51,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:09:51,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:51,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2077767781, now seen corresponding path program 1 times [2025-01-09 10:09:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:51,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219321573] [2025-01-09 10:09:51,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:51,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-01-09 10:09:51,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-01-09 10:09:51,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:51,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:51,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219321573] [2025-01-09 10:09:51,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219321573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:51,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:51,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676132215] [2025-01-09 10:09:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:51,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:51,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:51,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:51,412 INFO L87 Difference]: Start difference. First operand 8703 states and 14549 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:51,824 INFO L93 Difference]: Finished difference Result 26103 states and 43641 transitions. [2025-01-09 10:09:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:51,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-01-09 10:09:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:51,875 INFO L225 Difference]: With dead ends: 26103 [2025-01-09 10:09:51,875 INFO L226 Difference]: Without dead ends: 17403 [2025-01-09 10:09:51,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:51,902 INFO L435 NwaCegarLoop]: 1191 mSDtfsCounter, 615 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:51,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1806 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17403 states. [2025-01-09 10:09:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17403 to 17369. [2025-01-09 10:09:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17369 states, 15230 states have (on average 1.627445830597505) internal successors, (24786), 15274 states have internal predecessors, (24786), 2066 states have call successors, (2066), 72 states have call predecessors, (2066), 72 states have return successors, (2066), 2022 states have call predecessors, (2066), 2066 states have call successors, (2066) [2025-01-09 10:09:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17369 states to 17369 states and 28918 transitions. [2025-01-09 10:09:52,444 INFO L78 Accepts]: Start accepts. Automaton has 17369 states and 28918 transitions. Word has length 821 [2025-01-09 10:09:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:52,445 INFO L471 AbstractCegarLoop]: Abstraction has 17369 states and 28918 transitions. [2025-01-09 10:09:52,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 17369 states and 28918 transitions. [2025-01-09 10:09:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-01-09 10:09:52,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:52,459 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:52,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:09:52,459 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:52,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash -411761181, now seen corresponding path program 1 times [2025-01-09 10:09:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:52,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593267615] [2025-01-09 10:09:52,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:52,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:52,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-01-09 10:09:52,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-01-09 10:09:52,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:52,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:52,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:52,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593267615] [2025-01-09 10:09:52,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593267615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:52,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:52,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462141144] [2025-01-09 10:09:52,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:52,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:52,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:52,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:52,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:52,715 INFO L87 Difference]: Start difference. First operand 17369 states and 28918 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:53,182 INFO L93 Difference]: Finished difference Result 39509 states and 65356 transitions. [2025-01-09 10:09:53,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:53,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-01-09 10:09:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:53,264 INFO L225 Difference]: With dead ends: 39509 [2025-01-09 10:09:53,264 INFO L226 Difference]: Without dead ends: 22143 [2025-01-09 10:09:53,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:53,306 INFO L435 NwaCegarLoop]: 1103 mSDtfsCounter, 525 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:53,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1713 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:53,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22143 states. [2025-01-09 10:09:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22143 to 17369. [2025-01-09 10:09:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17369 states, 15230 states have (on average 1.6116874589625738) internal successors, (24546), 15274 states have internal predecessors, (24546), 2066 states have call successors, (2066), 72 states have call predecessors, (2066), 72 states have return successors, (2066), 2022 states have call predecessors, (2066), 2066 states have call successors, (2066) [2025-01-09 10:09:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17369 states to 17369 states and 28678 transitions. [2025-01-09 10:09:54,105 INFO L78 Accepts]: Start accepts. Automaton has 17369 states and 28678 transitions. Word has length 821 [2025-01-09 10:09:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:54,107 INFO L471 AbstractCegarLoop]: Abstraction has 17369 states and 28678 transitions. [2025-01-09 10:09:54,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 17369 states and 28678 transitions. [2025-01-09 10:09:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-01-09 10:09:54,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:54,125 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:54,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:09:54,126 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:54,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash 10940645, now seen corresponding path program 1 times [2025-01-09 10:09:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:54,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097248419] [2025-01-09 10:09:54,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:54,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-01-09 10:09:54,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-01-09 10:09:54,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:54,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:54,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:54,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097248419] [2025-01-09 10:09:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097248419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:54,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:54,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828680522] [2025-01-09 10:09:54,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:54,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:54,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:54,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:54,386 INFO L87 Difference]: Start difference. First operand 17369 states and 28678 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:55,074 INFO L93 Difference]: Finished difference Result 43785 states and 72146 transitions. [2025-01-09 10:09:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:55,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-01-09 10:09:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:55,166 INFO L225 Difference]: With dead ends: 43785 [2025-01-09 10:09:55,167 INFO L226 Difference]: Without dead ends: 26419 [2025-01-09 10:09:55,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:55,203 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 263 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:55,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1300 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26419 states. [2025-01-09 10:09:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26419 to 26369. [2025-01-09 10:09:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26369 states, 23126 states have (on average 1.606589985297933) internal successors, (37154), 23218 states have internal predecessors, (37154), 3122 states have call successors, (3122), 120 states have call predecessors, (3122), 120 states have return successors, (3122), 3030 states have call predecessors, (3122), 3122 states have call successors, (3122) [2025-01-09 10:09:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26369 states to 26369 states and 43398 transitions. [2025-01-09 10:09:56,162 INFO L78 Accepts]: Start accepts. Automaton has 26369 states and 43398 transitions. Word has length 821 [2025-01-09 10:09:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:56,164 INFO L471 AbstractCegarLoop]: Abstraction has 26369 states and 43398 transitions. [2025-01-09 10:09:56,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 26369 states and 43398 transitions. [2025-01-09 10:09:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2025-01-09 10:09:56,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:56,182 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:56,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:09:56,183 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:56,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1983204061, now seen corresponding path program 1 times [2025-01-09 10:09:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:56,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194198254] [2025-01-09 10:09:56,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:56,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:56,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 821 statements into 1 equivalence classes. [2025-01-09 10:09:56,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 821 of 821 statements. [2025-01-09 10:09:56,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:56,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:56,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:56,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194198254] [2025-01-09 10:09:56,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194198254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:56,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:56,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:56,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646032449] [2025-01-09 10:09:56,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:56,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:56,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:56,395 INFO L87 Difference]: Start difference. First operand 26369 states and 43398 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:57,218 INFO L93 Difference]: Finished difference Result 78813 states and 129612 transitions. [2025-01-09 10:09:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:57,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 821 [2025-01-09 10:09:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:57,353 INFO L225 Difference]: With dead ends: 78813 [2025-01-09 10:09:57,353 INFO L226 Difference]: Without dead ends: 52447 [2025-01-09 10:09:57,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:57,409 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 613 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:57,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1844 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52447 states. [2025-01-09 10:09:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52447 to 26561. [2025-01-09 10:09:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26561 states, 23318 states have (on average 1.6015953340766789) internal successors, (37346), 23410 states have internal predecessors, (37346), 3122 states have call successors, (3122), 120 states have call predecessors, (3122), 120 states have return successors, (3122), 3030 states have call predecessors, (3122), 3122 states have call successors, (3122) [2025-01-09 10:09:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26561 states to 26561 states and 43590 transitions. [2025-01-09 10:09:58,487 INFO L78 Accepts]: Start accepts. Automaton has 26561 states and 43590 transitions. Word has length 821 [2025-01-09 10:09:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:58,488 INFO L471 AbstractCegarLoop]: Abstraction has 26561 states and 43590 transitions. [2025-01-09 10:09:58,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:09:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 26561 states and 43590 transitions. [2025-01-09 10:09:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2025-01-09 10:09:58,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:58,506 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:58,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:09:58,506 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:58,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash -431101684, now seen corresponding path program 1 times [2025-01-09 10:09:58,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:58,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729637447] [2025-01-09 10:09:58,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:58,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:58,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes. [2025-01-09 10:09:58,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements. [2025-01-09 10:09:58,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:58,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:09:58,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:58,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729637447] [2025-01-09 10:09:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729637447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:58,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:58,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:58,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845263557] [2025-01-09 10:09:58,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:58,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:58,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:58,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:58,863 INFO L87 Difference]: Start difference. First operand 26561 states and 43590 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:10:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:01,059 INFO L93 Difference]: Finished difference Result 96551 states and 157439 transitions. [2025-01-09 10:10:01,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:10:01,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 822 [2025-01-09 10:10:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:01,433 INFO L225 Difference]: With dead ends: 96551 [2025-01-09 10:10:01,433 INFO L226 Difference]: Without dead ends: 69993 [2025-01-09 10:10:01,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:10:01,471 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 573 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:01,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1790 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:10:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69993 states. [2025-01-09 10:10:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69993 to 32057. [2025-01-09 10:10:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32057 states, 28814 states have (on average 1.6117859373915457) internal successors, (46442), 28906 states have internal predecessors, (46442), 3122 states have call successors, (3122), 120 states have call predecessors, (3122), 120 states have return successors, (3122), 3030 states have call predecessors, (3122), 3122 states have call successors, (3122) [2025-01-09 10:10:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32057 states to 32057 states and 52686 transitions. [2025-01-09 10:10:02,630 INFO L78 Accepts]: Start accepts. Automaton has 32057 states and 52686 transitions. Word has length 822 [2025-01-09 10:10:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:02,631 INFO L471 AbstractCegarLoop]: Abstraction has 32057 states and 52686 transitions. [2025-01-09 10:10:02,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:10:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 32057 states and 52686 transitions. [2025-01-09 10:10:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2025-01-09 10:10:02,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:02,647 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:02,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:10:02,647 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:02,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash -390426934, now seen corresponding path program 1 times [2025-01-09 10:10:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402562870] [2025-01-09 10:10:02,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:02,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:02,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes. [2025-01-09 10:10:02,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements. [2025-01-09 10:10:02,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:02,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:10:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402562870] [2025-01-09 10:10:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402562870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831390882] [2025-01-09 10:10:03,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:03,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:03,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:03,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:03,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:03,099 INFO L87 Difference]: Start difference. First operand 32057 states and 52686 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:10:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:04,130 INFO L93 Difference]: Finished difference Result 80187 states and 131867 transitions. [2025-01-09 10:10:04,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:04,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 822 [2025-01-09 10:10:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:04,256 INFO L225 Difference]: With dead ends: 80187 [2025-01-09 10:10:04,256 INFO L226 Difference]: Without dead ends: 48133 [2025-01-09 10:10:04,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:04,320 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 346 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:04,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1233 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48133 states. [2025-01-09 10:10:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48133 to 48035. [2025-01-09 10:10:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48035 states, 43171 states have (on average 1.6099928192536657) internal successors, (69505), 43309 states have internal predecessors, (69505), 4683 states have call successors, (4683), 180 states have call predecessors, (4683), 180 states have return successors, (4683), 4545 states have call predecessors, (4683), 4683 states have call successors, (4683) [2025-01-09 10:10:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48035 states to 48035 states and 78871 transitions. [2025-01-09 10:10:05,951 INFO L78 Accepts]: Start accepts. Automaton has 48035 states and 78871 transitions. Word has length 822 [2025-01-09 10:10:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:05,952 INFO L471 AbstractCegarLoop]: Abstraction has 48035 states and 78871 transitions. [2025-01-09 10:10:05,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-01-09 10:10:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 48035 states and 78871 transitions. [2025-01-09 10:10:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2025-01-09 10:10:05,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:05,985 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:05,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:10:05,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:05,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2105637132, now seen corresponding path program 1 times [2025-01-09 10:10:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:05,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133089712] [2025-01-09 10:10:05,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:05,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:06,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes. [2025-01-09 10:10:06,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements. [2025-01-09 10:10:06,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:06,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:10:07,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133089712] [2025-01-09 10:10:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133089712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:07,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:07,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:10:07,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222912363] [2025-01-09 10:10:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:07,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:10:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:07,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:10:07,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:10:07,967 INFO L87 Difference]: Start difference. First operand 48035 states and 78871 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-01-09 10:10:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:15,564 INFO L93 Difference]: Finished difference Result 320259 states and 522519 transitions. [2025-01-09 10:10:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:10:15,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) Word has length 822 [2025-01-09 10:10:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:16,233 INFO L225 Difference]: With dead ends: 320259 [2025-01-09 10:10:16,233 INFO L226 Difference]: Without dead ends: 272227 [2025-01-09 10:10:16,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:10:16,369 INFO L435 NwaCegarLoop]: 1180 mSDtfsCounter, 3866 mSDsluCounter, 6000 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3866 SdHoareTripleChecker+Valid, 7180 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1625 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:16,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3866 Valid, 7180 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1625 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:10:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272227 states. [2025-01-09 10:10:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272227 to 169041. [2025-01-09 10:10:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169041 states, 150502 states have (on average 1.5998325603646464) internal successors, (240778), 151067 states have internal predecessors, (240778), 17813 states have call successors, (17813), 725 states have call predecessors, (17813), 725 states have return successors, (17813), 17248 states have call predecessors, (17813), 17813 states have call successors, (17813) [2025-01-09 10:10:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169041 states to 169041 states and 276404 transitions. [2025-01-09 10:10:23,503 INFO L78 Accepts]: Start accepts. Automaton has 169041 states and 276404 transitions. Word has length 822 [2025-01-09 10:10:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:23,505 INFO L471 AbstractCegarLoop]: Abstraction has 169041 states and 276404 transitions. [2025-01-09 10:10:23,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-01-09 10:10:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 169041 states and 276404 transitions. [2025-01-09 10:10:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2025-01-09 10:10:23,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:23,620 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:23,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:10:23,621 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:23,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1246875051, now seen corresponding path program 1 times [2025-01-09 10:10:23,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:23,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469706084] [2025-01-09 10:10:23,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:23,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:23,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 823 statements into 1 equivalence classes. [2025-01-09 10:10:23,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 823 of 823 statements. [2025-01-09 10:10:23,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:23,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 34060 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34060 trivial. 0 not checked. [2025-01-09 10:10:24,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469706084] [2025-01-09 10:10:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469706084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:24,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:24,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:10:24,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541631248] [2025-01-09 10:10:24,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:24,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:10:24,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:24,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:10:24,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:24,564 INFO L87 Difference]: Start difference. First operand 169041 states and 276404 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 2 states have call successors, (131), 1 states have call predecessors, (131), 1 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131)