./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12d3a43944bcf873edb66a7d9a5f702d0b9b38d53543038559519bc18ead71d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:08:45,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:08:46,060 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:08:46,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:08:46,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:08:46,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:08:46,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:08:46,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:08:46,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:08:46,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:08:46,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:08:46,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:08:46,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:08:46,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:08:46,099 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:08:46,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:08:46,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:08:46,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:46,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:46,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:08:46,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:08:46,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:08:46,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:08:46,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:08:46,103 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 -> 12d3a43944bcf873edb66a7d9a5f702d0b9b38d53543038559519bc18ead71d6 [2025-01-09 10:08:46,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:08:46,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:08:46,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:08:46,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:08:46,410 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:08:46,412 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-84.i [2025-01-09 10:08:47,750 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0dc0cdedc/392c88b0c5c84831beee50862b660567/FLAGef1bd7383 [2025-01-09 10:08:48,074 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:08:48,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-84.i [2025-01-09 10:08:48,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0dc0cdedc/392c88b0c5c84831beee50862b660567/FLAGef1bd7383 [2025-01-09 10:08:48,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0dc0cdedc/392c88b0c5c84831beee50862b660567 [2025-01-09 10:08:48,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:08:48,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:08:48,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:08:48,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:08:48,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:08:48,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79460c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48, skipping insertion in model container [2025-01-09 10:08:48,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:08:48,312 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-84.i[916,929] [2025-01-09 10:08:48,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:08:48,536 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:08:48,550 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-84.i[916,929] [2025-01-09 10:08:48,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:08:48,662 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:08:48,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48 WrapperNode [2025-01-09 10:08:48,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:08:48,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:08:48,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:08:48,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:08:48,671 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:08:48" (1/1) ... [2025-01-09 10:08:48,702 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:08:48" (1/1) ... [2025-01-09 10:08:48,781 INFO L138 Inliner]: procedures = 26, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 991 [2025-01-09 10:08:48,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:08:48,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:08:48,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:08:48,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:08:48,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,844 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:08:48,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:08:48,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:08:48,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:08:48,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:08:48,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (1/1) ... [2025-01-09 10:08:48,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:48,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:48,978 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:08:48,984 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:08:49,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:08:49,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:08:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:08:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:08:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:08:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:08:49,175 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:08:49,176 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:08:50,610 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-01-09 10:08:50,610 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:08:50,637 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:08:50,637 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:08:50,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:08:50 BoogieIcfgContainer [2025-01-09 10:08:50,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:08:50,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:08:50,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:08:50,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:08:50,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:08:48" (1/3) ... [2025-01-09 10:08:50,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f32f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:08:50, skipping insertion in model container [2025-01-09 10:08:50,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:48" (2/3) ... [2025-01-09 10:08:50,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f32f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:08:50, skipping insertion in model container [2025-01-09 10:08:50,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:08:50" (3/3) ... [2025-01-09 10:08:50,652 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-84.i [2025-01-09 10:08:50,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:08:50,670 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-84.i that has 2 procedures, 404 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:08:50,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:08:50,756 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;@3e8f416b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:08:50,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:08:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 404 states, 276 states have (on average 1.5724637681159421) internal successors, (434), 277 states have internal predecessors, (434), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-01-09 10:08:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2025-01-09 10:08:50,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:50,820 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:50,820 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:50,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 734493031, now seen corresponding path program 1 times [2025-01-09 10:08:50,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:50,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069409842] [2025-01-09 10:08:50,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:50,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:50,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 793 statements into 1 equivalence classes. [2025-01-09 10:08:51,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 793 of 793 statements. [2025-01-09 10:08:51,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:51,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2025-01-09 10:08:51,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:51,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069409842] [2025-01-09 10:08:51,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069409842] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:08:51,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163846269] [2025-01-09 10:08:51,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:51,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:08:51,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:51,675 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:08:51,677 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:08:51,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 793 statements into 1 equivalence classes. [2025-01-09 10:08:52,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 793 of 793 statements. [2025-01-09 10:08:52,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:52,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:52,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:08:52,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:08:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2025-01-09 10:08:52,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:08:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163846269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:52,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:08:52,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:08:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754836779] [2025-01-09 10:08:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:08:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:52,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:08:52,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:08:52,336 INFO L87 Difference]: Start difference. First operand has 404 states, 276 states have (on average 1.5724637681159421) internal successors, (434), 277 states have internal predecessors, (434), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-01-09 10:08:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:52,427 INFO L93 Difference]: Finished difference Result 801 states and 1486 transitions. [2025-01-09 10:08:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:08:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) Word has length 793 [2025-01-09 10:08:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:52,438 INFO L225 Difference]: With dead ends: 801 [2025-01-09 10:08:52,439 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 10:08:52,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 794 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:08:52,451 INFO L435 NwaCegarLoop]: 675 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, 675 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:08:52,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 10:08:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-01-09 10:08:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 273 states have (on average 1.5567765567765568) internal successors, (425), 273 states have internal predecessors, (425), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-01-09 10:08:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 675 transitions. [2025-01-09 10:08:52,558 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 675 transitions. Word has length 793 [2025-01-09 10:08:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:52,558 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 675 transitions. [2025-01-09 10:08:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-01-09 10:08:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 675 transitions. [2025-01-09 10:08:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-01-09 10:08:52,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:52,578 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:52,590 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:08:52,779 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:08:52,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:52,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1335333144, now seen corresponding path program 1 times [2025-01-09 10:08:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26429572] [2025-01-09 10:08:52,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:52,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-01-09 10:08:52,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-01-09 10:08:52,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:52,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:08:53,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:53,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26429572] [2025-01-09 10:08:53,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26429572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:53,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:53,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:53,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931381829] [2025-01-09 10:08:53,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:53,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:53,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:53,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:53,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:53,772 INFO L87 Difference]: Start difference. First operand 400 states and 675 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:08:53,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:53,896 INFO L93 Difference]: Finished difference Result 1066 states and 1805 transitions. [2025-01-09 10:08:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:53,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-01-09 10:08:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:53,905 INFO L225 Difference]: With dead ends: 1066 [2025-01-09 10:08:53,905 INFO L226 Difference]: Without dead ends: 669 [2025-01-09 10:08:53,907 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:08:53,908 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 450 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:53,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1446 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:08:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-01-09 10:08:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 666. [2025-01-09 10:08:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 489 states have (on average 1.586912065439673) internal successors, (776), 490 states have internal predecessors, (776), 174 states have call successors, (174), 2 states have call predecessors, (174), 2 states have return successors, (174), 173 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 10:08:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1124 transitions. [2025-01-09 10:08:53,990 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1124 transitions. Word has length 794 [2025-01-09 10:08:53,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:53,993 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1124 transitions. [2025-01-09 10:08:53,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:08:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1124 transitions. [2025-01-09 10:08:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-01-09 10:08:54,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:54,013 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:54,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:08:54,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:54,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash -951445266, now seen corresponding path program 1 times [2025-01-09 10:08:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:54,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779168946] [2025-01-09 10:08:54,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:54,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-01-09 10:08:54,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-01-09 10:08:54,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:54,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:08:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779168946] [2025-01-09 10:08:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779168946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:54,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:54,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571474845] [2025-01-09 10:08:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:54,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:54,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:54,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:54,551 INFO L87 Difference]: Start difference. First operand 666 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:08:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:54,661 INFO L93 Difference]: Finished difference Result 1845 states and 3113 transitions. [2025-01-09 10:08:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:54,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-01-09 10:08:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:54,681 INFO L225 Difference]: With dead ends: 1845 [2025-01-09 10:08:54,681 INFO L226 Difference]: Without dead ends: 1182 [2025-01-09 10:08:54,684 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:08:54,685 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 467 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:54,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1326 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-01-09 10:08:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1179. [2025-01-09 10:08:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 874 states have (on average 1.5812356979405033) internal successors, (1382), 877 states have internal predecessors, (1382), 300 states have call successors, (300), 4 states have call predecessors, (300), 4 states have return successors, (300), 297 states have call predecessors, (300), 300 states have call successors, (300) [2025-01-09 10:08:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1982 transitions. [2025-01-09 10:08:54,815 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1982 transitions. Word has length 794 [2025-01-09 10:08:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:54,818 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1982 transitions. [2025-01-09 10:08:54,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:08:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1982 transitions. [2025-01-09 10:08:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-01-09 10:08:54,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:54,827 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:54,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:08:54,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1358494730, now seen corresponding path program 1 times [2025-01-09 10:08:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:54,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496823677] [2025-01-09 10:08:54,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:54,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:54,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-01-09 10:08:54,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-01-09 10:08:54,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:54,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:08:55,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:55,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496823677] [2025-01-09 10:08:55,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496823677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:55,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:55,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:55,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656385830] [2025-01-09 10:08:55,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:55,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:55,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:55,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:55,261 INFO L87 Difference]: Start difference. First operand 1179 states and 1982 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:08:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:55,418 INFO L93 Difference]: Finished difference Result 3363 states and 5650 transitions. [2025-01-09 10:08:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-01-09 10:08:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:55,436 INFO L225 Difference]: With dead ends: 3363 [2025-01-09 10:08:55,436 INFO L226 Difference]: Without dead ends: 2187 [2025-01-09 10:08:55,441 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:08:55,442 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 453 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:55,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1527 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:08:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2025-01-09 10:08:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2183. [2025-01-09 10:08:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1626 states have (on average 1.5719557195571956) internal successors, (2556), 1633 states have internal predecessors, (2556), 548 states have call successors, (548), 8 states have call predecessors, (548), 8 states have return successors, (548), 541 states have call predecessors, (548), 548 states have call successors, (548) [2025-01-09 10:08:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3652 transitions. [2025-01-09 10:08:55,635 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3652 transitions. Word has length 794 [2025-01-09 10:08:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:55,637 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3652 transitions. [2025-01-09 10:08:55,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:08:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3652 transitions. [2025-01-09 10:08:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2025-01-09 10:08:55,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:55,646 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:55,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:08:55,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:55,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1720318840, now seen corresponding path program 1 times [2025-01-09 10:08:55,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:55,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826326515] [2025-01-09 10:08:55,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:55,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:55,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 794 statements into 1 equivalence classes. [2025-01-09 10:08:55,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 794 of 794 statements. [2025-01-09 10:08:55,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:55,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:08:56,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:56,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826326515] [2025-01-09 10:08:56,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826326515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:56,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:56,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:08:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766036879] [2025-01-09 10:08:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:08:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:56,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:08:56,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:56,395 INFO L87 Difference]: Start difference. First operand 2183 states and 3652 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:08:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:56,541 INFO L93 Difference]: Finished difference Result 4443 states and 7445 transitions. [2025-01-09 10:08:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:08:56,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 794 [2025-01-09 10:08:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:56,560 INFO L225 Difference]: With dead ends: 4443 [2025-01-09 10:08:56,560 INFO L226 Difference]: Without dead ends: 2263 [2025-01-09 10:08:56,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:56,569 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 12 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:56,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1346 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2025-01-09 10:08:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2215. [2025-01-09 10:08:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1658 states have (on average 1.5705669481302775) internal successors, (2604), 1665 states have internal predecessors, (2604), 548 states have call successors, (548), 8 states have call predecessors, (548), 8 states have return successors, (548), 541 states have call predecessors, (548), 548 states have call successors, (548) [2025-01-09 10:08:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3700 transitions. [2025-01-09 10:08:56,768 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3700 transitions. Word has length 794 [2025-01-09 10:08:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:56,769 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 3700 transitions. [2025-01-09 10:08:56,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:08:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3700 transitions. [2025-01-09 10:08:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-01-09 10:08:56,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:56,787 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:56,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:08:56,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:56,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:56,788 INFO L85 PathProgramCache]: Analyzing trace with hash -180624586, now seen corresponding path program 1 times [2025-01-09 10:08:56,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:56,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981170168] [2025-01-09 10:08:56,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:56,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:56,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-01-09 10:08:56,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-01-09 10:08:56,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:56,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:08:57,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:57,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981170168] [2025-01-09 10:08:57,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981170168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:57,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:57,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:08:57,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50685498] [2025-01-09 10:08:57,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:57,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:08:57,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:57,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:08:57,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:57,604 INFO L87 Difference]: Start difference. First operand 2215 states and 3700 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:08:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:58,914 INFO L93 Difference]: Finished difference Result 8685 states and 14507 transitions. [2025-01-09 10:08:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:08:58,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-01-09 10:08:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:58,959 INFO L225 Difference]: With dead ends: 8685 [2025-01-09 10:08:58,959 INFO L226 Difference]: Without dead ends: 6473 [2025-01-09 10:08:59,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:59,020 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1532 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:59,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 2038 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:08:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6473 states. [2025-01-09 10:08:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6473 to 2451. [2025-01-09 10:08:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 1894 states have (on average 1.579725448785639) internal successors, (2992), 1901 states have internal predecessors, (2992), 548 states have call successors, (548), 8 states have call predecessors, (548), 8 states have return successors, (548), 541 states have call predecessors, (548), 548 states have call successors, (548) [2025-01-09 10:08:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 4088 transitions. [2025-01-09 10:08:59,318 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 4088 transitions. Word has length 795 [2025-01-09 10:08:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:59,320 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 4088 transitions. [2025-01-09 10:08:59,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:08:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 4088 transitions. [2025-01-09 10:08:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-01-09 10:08:59,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:59,330 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:59,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:08:59,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:59,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:59,332 INFO L85 PathProgramCache]: Analyzing trace with hash 253104500, now seen corresponding path program 1 times [2025-01-09 10:08:59,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:59,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42761899] [2025-01-09 10:08:59,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:59,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:59,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-01-09 10:08:59,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-01-09 10:08:59,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:59,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:09:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:00,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42761899] [2025-01-09 10:09:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42761899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:00,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:00,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:09:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610799527] [2025-01-09 10:09:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:00,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:09:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:00,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:09:00,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:09:00,184 INFO L87 Difference]: Start difference. First operand 2451 states and 4088 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-01-09 10:09:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:03,033 INFO L93 Difference]: Finished difference Result 8107 states and 13426 transitions. [2025-01-09 10:09:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:09:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) Word has length 795 [2025-01-09 10:09:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:03,067 INFO L225 Difference]: With dead ends: 8107 [2025-01-09 10:09:03,068 INFO L226 Difference]: Without dead ends: 5659 [2025-01-09 10:09:03,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:09:03,077 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 2401 mSDsluCounter, 3331 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 4582 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:03,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2401 Valid, 4582 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 10:09:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2025-01-09 10:09:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 5048. [2025-01-09 10:09:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5048 states, 3843 states have (on average 1.5625813166796774) internal successors, (6005), 3858 states have internal predecessors, (6005), 1179 states have call successors, (1179), 25 states have call predecessors, (1179), 25 states have return successors, (1179), 1164 states have call predecessors, (1179), 1179 states have call successors, (1179) [2025-01-09 10:09:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 8363 transitions. [2025-01-09 10:09:03,493 INFO L78 Accepts]: Start accepts. Automaton has 5048 states and 8363 transitions. Word has length 795 [2025-01-09 10:09:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:03,495 INFO L471 AbstractCegarLoop]: Abstraction has 5048 states and 8363 transitions. [2025-01-09 10:09:03,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 2 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-01-09 10:09:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5048 states and 8363 transitions. [2025-01-09 10:09:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-01-09 10:09:03,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:03,515 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:09:03,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:03,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:03,516 INFO L85 PathProgramCache]: Analyzing trace with hash 932376754, now seen corresponding path program 1 times [2025-01-09 10:09:03,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:03,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139015057] [2025-01-09 10:09:03,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:03,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:03,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-01-09 10:09:03,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-01-09 10:09:03,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:03,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:09:04,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:04,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139015057] [2025-01-09 10:09:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139015057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:04,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:04,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:09:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214154646] [2025-01-09 10:09:04,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:04,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:09:04,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:04,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:09:04,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:09:04,675 INFO L87 Difference]: Start difference. First operand 5048 states and 8363 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:05,831 INFO L93 Difference]: Finished difference Result 14848 states and 24583 transitions. [2025-01-09 10:09:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:09:05,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-01-09 10:09:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:05,908 INFO L225 Difference]: With dead ends: 14848 [2025-01-09 10:09:05,908 INFO L226 Difference]: Without dead ends: 9898 [2025-01-09 10:09:05,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:09:05,928 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 1724 mSDsluCounter, 5138 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 6283 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:05,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 6283 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:09:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9898 states. [2025-01-09 10:09:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 8752. [2025-01-09 10:09:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8752 states, 6403 states have (on average 1.545994065281899) internal successors, (9899), 6432 states have internal predecessors, (9899), 2299 states have call successors, (2299), 49 states have call predecessors, (2299), 49 states have return successors, (2299), 2270 states have call predecessors, (2299), 2299 states have call successors, (2299) [2025-01-09 10:09:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8752 states to 8752 states and 14497 transitions. [2025-01-09 10:09:06,812 INFO L78 Accepts]: Start accepts. Automaton has 8752 states and 14497 transitions. Word has length 795 [2025-01-09 10:09:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:06,814 INFO L471 AbstractCegarLoop]: Abstraction has 8752 states and 14497 transitions. [2025-01-09 10:09:06,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 8752 states and 14497 transitions. [2025-01-09 10:09:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-01-09 10:09:06,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:06,828 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:09:06,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:06,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:06,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1868573393, now seen corresponding path program 1 times [2025-01-09 10:09:06,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:06,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237891712] [2025-01-09 10:09:06,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:06,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:06,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-01-09 10:09:06,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-01-09 10:09:06,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:06,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:09:07,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:07,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237891712] [2025-01-09 10:09:07,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237891712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:07,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:07,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646859911] [2025-01-09 10:09:07,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:07,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:07,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:07,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:07,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:07,574 INFO L87 Difference]: Start difference. First operand 8752 states and 14497 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:08,887 INFO L93 Difference]: Finished difference Result 26060 states and 43179 transitions. [2025-01-09 10:09:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:08,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-01-09 10:09:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:08,975 INFO L225 Difference]: With dead ends: 26060 [2025-01-09 10:09:08,976 INFO L226 Difference]: Without dead ends: 17406 [2025-01-09 10:09:09,007 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:09:09,009 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 438 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1340 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:09,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1340 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:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17406 states. [2025-01-09 10:09:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17406 to 17244. [2025-01-09 10:09:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17244 states, 12607 states have (on average 1.5422384389624813) internal successors, (19443), 12664 states have internal predecessors, (19443), 4539 states have call successors, (4539), 97 states have call predecessors, (4539), 97 states have return successors, (4539), 4482 states have call predecessors, (4539), 4539 states have call successors, (4539) [2025-01-09 10:09:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17244 states to 17244 states and 28521 transitions. [2025-01-09 10:09:10,758 INFO L78 Accepts]: Start accepts. Automaton has 17244 states and 28521 transitions. Word has length 795 [2025-01-09 10:09:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:10,760 INFO L471 AbstractCegarLoop]: Abstraction has 17244 states and 28521 transitions. [2025-01-09 10:09:10,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 17244 states and 28521 transitions. [2025-01-09 10:09:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-01-09 10:09:10,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:10,780 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:09:10,780 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:10,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -598832751, now seen corresponding path program 1 times [2025-01-09 10:09:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738673365] [2025-01-09 10:09:10,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:10,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-01-09 10:09:10,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-01-09 10:09:10,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:10,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:09:11,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:11,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738673365] [2025-01-09 10:09:11,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738673365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:11,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:11,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:11,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403248897] [2025-01-09 10:09:11,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:11,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:11,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:11,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:11,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:11,705 INFO L87 Difference]: Start difference. First operand 17244 states and 28521 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:14,702 INFO L93 Difference]: Finished difference Result 49466 states and 81851 transitions. [2025-01-09 10:09:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:09:14,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-01-09 10:09:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:15,032 INFO L225 Difference]: With dead ends: 49466 [2025-01-09 10:09:15,032 INFO L226 Difference]: Without dead ends: 32320 [2025-01-09 10:09:15,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:15,087 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 1029 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:15,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 1674 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:09:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32320 states. [2025-01-09 10:09:16,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32320 to 23516. [2025-01-09 10:09:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23516 states, 18879 states have (on average 1.6010911594893797) internal successors, (30227), 18936 states have internal predecessors, (30227), 4539 states have call successors, (4539), 97 states have call predecessors, (4539), 97 states have return successors, (4539), 4482 states have call predecessors, (4539), 4539 states have call successors, (4539) [2025-01-09 10:09:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23516 states to 23516 states and 39305 transitions. [2025-01-09 10:09:17,015 INFO L78 Accepts]: Start accepts. Automaton has 23516 states and 39305 transitions. Word has length 795 [2025-01-09 10:09:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:17,016 INFO L471 AbstractCegarLoop]: Abstraction has 23516 states and 39305 transitions. [2025-01-09 10:09:17,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 23516 states and 39305 transitions. [2025-01-09 10:09:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-01-09 10:09:17,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:17,047 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:09:17,048 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash 430526547, now seen corresponding path program 1 times [2025-01-09 10:09:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418333384] [2025-01-09 10:09:17,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:17,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-01-09 10:09:17,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-01-09 10:09:17,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:17,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:09:17,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:17,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418333384] [2025-01-09 10:09:17,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418333384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:17,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:17,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109536219] [2025-01-09 10:09:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:17,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:17,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:17,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:17,658 INFO L87 Difference]: Start difference. First operand 23516 states and 39305 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:18,667 INFO L93 Difference]: Finished difference Result 46934 states and 78454 transitions. [2025-01-09 10:09:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-01-09 10:09:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:18,780 INFO L225 Difference]: With dead ends: 46934 [2025-01-09 10:09:18,780 INFO L226 Difference]: Without dead ends: 23516 [2025-01-09 10:09:18,838 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:09:18,839 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 672 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:18,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 671 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23516 states. [2025-01-09 10:09:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23516 to 23516. [2025-01-09 10:09:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23516 states, 18879 states have (on average 1.5977011494252873) internal successors, (30163), 18936 states have internal predecessors, (30163), 4539 states have call successors, (4539), 97 states have call predecessors, (4539), 97 states have return successors, (4539), 4482 states have call predecessors, (4539), 4539 states have call successors, (4539) [2025-01-09 10:09:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23516 states to 23516 states and 39241 transitions. [2025-01-09 10:09:20,746 INFO L78 Accepts]: Start accepts. Automaton has 23516 states and 39241 transitions. Word has length 795 [2025-01-09 10:09:20,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:20,747 INFO L471 AbstractCegarLoop]: Abstraction has 23516 states and 39241 transitions. [2025-01-09 10:09:20,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 23516 states and 39241 transitions. [2025-01-09 10:09:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2025-01-09 10:09:20,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:20,785 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:09:20,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:20,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 688691985, now seen corresponding path program 1 times [2025-01-09 10:09:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:20,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420256699] [2025-01-09 10:09:20,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:20,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 795 statements into 1 equivalence classes. [2025-01-09 10:09:20,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 795 of 795 statements. [2025-01-09 10:09:20,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:20,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:09:24,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:24,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420256699] [2025-01-09 10:09:24,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420256699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:24,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:24,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:09:24,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838140234] [2025-01-09 10:09:24,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:24,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:09:24,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:24,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:09:24,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:09:24,586 INFO L87 Difference]: Start difference. First operand 23516 states and 39241 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:26,781 INFO L93 Difference]: Finished difference Result 49052 states and 81210 transitions. [2025-01-09 10:09:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:09:26,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 795 [2025-01-09 10:09:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:26,906 INFO L225 Difference]: With dead ends: 49052 [2025-01-09 10:09:26,906 INFO L226 Difference]: Without dead ends: 25634 [2025-01-09 10:09:26,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:09:26,952 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 69 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:26,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2631 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:09:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25634 states. [2025-01-09 10:09:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25634 to 25568. [2025-01-09 10:09:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25568 states, 20610 states have (on average 1.5723435225618632) internal successors, (32406), 20731 states have internal predecessors, (32406), 4795 states have call successors, (4795), 162 states have call predecessors, (4795), 162 states have return successors, (4795), 4674 states have call predecessors, (4795), 4795 states have call successors, (4795) [2025-01-09 10:09:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25568 states to 25568 states and 41996 transitions. [2025-01-09 10:09:28,791 INFO L78 Accepts]: Start accepts. Automaton has 25568 states and 41996 transitions. Word has length 795 [2025-01-09 10:09:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:28,792 INFO L471 AbstractCegarLoop]: Abstraction has 25568 states and 41996 transitions. [2025-01-09 10:09:28,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 25568 states and 41996 transitions. [2025-01-09 10:09:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2025-01-09 10:09:28,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:28,820 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:09:28,820 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:28,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash 491021534, now seen corresponding path program 1 times [2025-01-09 10:09:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703891799] [2025-01-09 10:09:28,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:28,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:28,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 796 statements into 1 equivalence classes. [2025-01-09 10:09:28,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 796 of 796 statements. [2025-01-09 10:09:28,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:28,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:09:29,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:29,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703891799] [2025-01-09 10:09:29,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703891799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:29,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:29,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:09:29,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533766183] [2025-01-09 10:09:29,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:29,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:09:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:29,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:09:29,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:09:29,927 INFO L87 Difference]: Start difference. First operand 25568 states and 41996 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:34,560 INFO L93 Difference]: Finished difference Result 99236 states and 161627 transitions. [2025-01-09 10:09:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:09:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 796 [2025-01-09 10:09:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:34,798 INFO L225 Difference]: With dead ends: 99236 [2025-01-09 10:09:34,799 INFO L226 Difference]: Without dead ends: 73770 [2025-01-09 10:09:34,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:09:34,873 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 2568 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2568 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:34,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2568 Valid, 3394 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:09:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73770 states. [2025-01-09 10:09:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73770 to 65788. [2025-01-09 10:09:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65788 states, 56733 states have (on average 1.5970422857948636) internal successors, (90605), 57110 states have internal predecessors, (90605), 8603 states have call successors, (8603), 451 states have call predecessors, (8603), 451 states have return successors, (8603), 8226 states have call predecessors, (8603), 8603 states have call successors, (8603) [2025-01-09 10:09:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65788 states to 65788 states and 107811 transitions. [2025-01-09 10:09:38,698 INFO L78 Accepts]: Start accepts. Automaton has 65788 states and 107811 transitions. Word has length 796 [2025-01-09 10:09:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:38,700 INFO L471 AbstractCegarLoop]: Abstraction has 65788 states and 107811 transitions. [2025-01-09 10:09:38,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 65788 states and 107811 transitions. [2025-01-09 10:09:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2025-01-09 10:09:38,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:38,768 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:09:38,768 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:38,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:38,769 INFO L85 PathProgramCache]: Analyzing trace with hash 499063256, now seen corresponding path program 1 times [2025-01-09 10:09:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:38,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304721770] [2025-01-09 10:09:38,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:38,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 796 statements into 1 equivalence classes. [2025-01-09 10:09:38,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 796 of 796 statements. [2025-01-09 10:09:38,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:38,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:09:39,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:39,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304721770] [2025-01-09 10:09:39,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304721770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:39,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417897048] [2025-01-09 10:09:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:39,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:39,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:39,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:39,093 INFO L87 Difference]: Start difference. First operand 65788 states and 107811 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:41,514 INFO L93 Difference]: Finished difference Result 122384 states and 200425 transitions. [2025-01-09 10:09:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:41,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 796 [2025-01-09 10:09:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:41,720 INFO L225 Difference]: With dead ends: 122384 [2025-01-09 10:09:41,720 INFO L226 Difference]: Without dead ends: 56702 [2025-01-09 10:09:41,822 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:41,823 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 410 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:41,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1503 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56702 states. [2025-01-09 10:09:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56702 to 56496. [2025-01-09 10:09:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56496 states, 48465 states have (on average 1.5870628288455586) internal successors, (76917), 48778 states have internal predecessors, (76917), 7603 states have call successors, (7603), 427 states have call predecessors, (7603), 427 states have return successors, (7603), 7290 states have call predecessors, (7603), 7603 states have call successors, (7603) [2025-01-09 10:09:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56496 states to 56496 states and 92123 transitions. [2025-01-09 10:09:44,987 INFO L78 Accepts]: Start accepts. Automaton has 56496 states and 92123 transitions. Word has length 796 [2025-01-09 10:09:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:44,987 INFO L471 AbstractCegarLoop]: Abstraction has 56496 states and 92123 transitions. [2025-01-09 10:09:44,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-01-09 10:09:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 56496 states and 92123 transitions. [2025-01-09 10:09:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2025-01-09 10:09:45,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:45,032 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:09:45,033 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:45,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1885266650, now seen corresponding path program 1 times [2025-01-09 10:09:45,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:45,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346921216] [2025-01-09 10:09:45,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:45,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:45,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 796 statements into 1 equivalence classes. [2025-01-09 10:09:45,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 796 of 796 statements. [2025-01-09 10:09:45,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:45,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-01-09 10:09:47,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:47,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346921216] [2025-01-09 10:09:47,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346921216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:47,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:47,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:09:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945547296] [2025-01-09 10:09:47,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:47,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:09:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:47,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:09:47,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:09:47,094 INFO L87 Difference]: Start difference. First operand 56496 states and 92123 transitions. Second operand has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125)