./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.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_fillercodestructure_filler-pr-ci_file-66.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 0cbadd5c8de40e45d11c8c9bd5d5aa33e26bba45cb60181d9a1abcae7f03bb4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:07:16,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:07:17,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:07:17,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:07:17,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:07:17,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:07:17,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:07:17,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:07:17,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:07:17,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:07:17,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:07:17,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:07:17,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:07:17,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:07:17,085 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:07:17,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:07:17,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:07:17,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:07:17,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:07:17,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:07:17,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:07:17,087 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:07:17,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:07:17,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:07:17,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:07:17,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:07:17,088 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 -> 0cbadd5c8de40e45d11c8c9bd5d5aa33e26bba45cb60181d9a1abcae7f03bb4b [2025-01-09 11:07:17,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:07:17,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:07:17,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:07:17,428 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:07:17,428 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:07:17,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-01-09 11:07:18,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/025adabb5/82e20a9fc65140848a96246a9a231a5e/FLAGb63163f63 [2025-01-09 11:07:19,132 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:07:19,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-01-09 11:07:19,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/025adabb5/82e20a9fc65140848a96246a9a231a5e/FLAGb63163f63 [2025-01-09 11:07:19,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/025adabb5/82e20a9fc65140848a96246a9a231a5e [2025-01-09 11:07:19,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:07:19,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:07:19,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:07:19,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:07:19,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:07:19,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19, skipping insertion in model container [2025-01-09 11:07:19,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:07:19,517 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_fillercodestructure_filler-pr-ci_file-66.i[919,932] [2025-01-09 11:07:19,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:07:19,578 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:07:19,586 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_fillercodestructure_filler-pr-ci_file-66.i[919,932] [2025-01-09 11:07:19,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:07:19,630 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:07:19,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19 WrapperNode [2025-01-09 11:07:19,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:07:19,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:07:19,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:07:19,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:07:19,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,670 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-01-09 11:07:19,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:07:19,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:07:19,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:07:19,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:07:19,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,698 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 11:07:19,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:07:19,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:07:19,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:07:19,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:07:19,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (1/1) ... [2025-01-09 11:07:19,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:07:19,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:07:19,744 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 11:07:19,758 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 11:07:19,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:07:19,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:07:19,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:07:19,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:07:19,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:07:19,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:07:19,825 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:07:19,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:07:20,073 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 11:07:20,073 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:07:20,083 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:07:20,085 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:07:20,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:07:20 BoogieIcfgContainer [2025-01-09 11:07:20,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:07:20,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:07:20,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:07:20,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:07:20,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:07:19" (1/3) ... [2025-01-09 11:07:20,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad2d267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:07:20, skipping insertion in model container [2025-01-09 11:07:20,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:07:19" (2/3) ... [2025-01-09 11:07:20,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad2d267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:07:20, skipping insertion in model container [2025-01-09 11:07:20,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:07:20" (3/3) ... [2025-01-09 11:07:20,093 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-01-09 11:07:20,103 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:07:20,105 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:07:20,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:07:20,151 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;@77230b76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:07:20,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:07:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:07:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 11:07:20,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:20,165 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:07:20,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:20,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1849740112, now seen corresponding path program 1 times [2025-01-09 11:07:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:07:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111604891] [2025-01-09 11:07:20,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:07:20,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 11:07:20,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 11:07:20,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:20,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 11:07:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:07:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111604891] [2025-01-09 11:07:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111604891] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:07:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914422179] [2025-01-09 11:07:20,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:20,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:07:20,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:07:20,457 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 11:07:20,458 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 11:07:20,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 11:07:20,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 11:07:20,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:20,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:20,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:07:20,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:07:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 11:07:20,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:07:20,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914422179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:20,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:07:20,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:07:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493774850] [2025-01-09 11:07:20,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:20,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:07:20,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:07:20,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:07:20,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:07:20,632 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:07:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:20,656 INFO L93 Difference]: Finished difference Result 154 states and 269 transitions. [2025-01-09 11:07:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:07:20,657 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-01-09 11:07:20,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:20,662 INFO L225 Difference]: With dead ends: 154 [2025-01-09 11:07:20,663 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 11:07:20,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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 11:07:20,669 INFO L435 NwaCegarLoop]: 121 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, 121 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 11:07:20,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:07:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 11:07:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 11:07:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 53 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:07:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2025-01-09 11:07:20,702 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 149 [2025-01-09 11:07:20,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:20,702 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 121 transitions. [2025-01-09 11:07:20,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:07:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 121 transitions. [2025-01-09 11:07:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 11:07:20,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:20,706 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:07:20,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:07:20,906 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 11:07:20,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:20,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash -586038612, now seen corresponding path program 1 times [2025-01-09 11:07:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:07:20,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814704855] [2025-01-09 11:07:20,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:20,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:07:20,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 11:07:20,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 11:07:20,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:20,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:07:21,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:07:21,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814704855] [2025-01-09 11:07:21,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814704855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:21,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:21,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:07:21,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485307148] [2025-01-09 11:07:21,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:21,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:07:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:07:21,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:07:21,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:07:21,140 INFO L87 Difference]: Start difference. First operand 77 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:07:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:21,189 INFO L93 Difference]: Finished difference Result 151 states and 239 transitions. [2025-01-09 11:07:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:07:21,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-01-09 11:07:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:21,191 INFO L225 Difference]: With dead ends: 151 [2025-01-09 11:07:21,191 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 11:07:21,192 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 11:07:21,192 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:21,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 106 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:07:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 11:07:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 11:07:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:07:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2025-01-09 11:07:21,205 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 149 [2025-01-09 11:07:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:21,206 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2025-01-09 11:07:21,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:07:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2025-01-09 11:07:21,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 11:07:21,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:21,208 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:07:21,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:07:21,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:21,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:21,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1188968750, now seen corresponding path program 1 times [2025-01-09 11:07:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:07:21,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612568229] [2025-01-09 11:07:21,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:07:21,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 11:07:21,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 11:07:21,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:21,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:07:21,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:07:21,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612568229] [2025-01-09 11:07:21,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612568229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:21,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:21,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:07:21,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83631151] [2025-01-09 11:07:21,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:21,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:07:21,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:07:21,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:07:21,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:07:21,920 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:07:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:22,134 INFO L93 Difference]: Finished difference Result 198 states and 309 transitions. [2025-01-09 11:07:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:07:22,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-01-09 11:07:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:22,136 INFO L225 Difference]: With dead ends: 198 [2025-01-09 11:07:22,136 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 11:07:22,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:07:22,137 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 200 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:22,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 204 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:07:22,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 11:07:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2025-01-09 11:07:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 91 states have internal predecessors, (133), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 11:07:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 189 transitions. [2025-01-09 11:07:22,147 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 189 transitions. Word has length 149 [2025-01-09 11:07:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:22,148 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 189 transitions. [2025-01-09 11:07:22,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:07:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 189 transitions. [2025-01-09 11:07:22,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 11:07:22,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:22,149 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:07:22,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:07:22,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:22,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:22,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1417054804, now seen corresponding path program 1 times [2025-01-09 11:07:22,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:07:22,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806962712] [2025-01-09 11:07:22,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:07:22,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 11:07:22,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 11:07:22,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:22,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:07:22,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:07:22,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806962712] [2025-01-09 11:07:22,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806962712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:22,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:22,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:07:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323364377] [2025-01-09 11:07:22,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:22,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:07:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:07:22,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:07:22,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:07:22,378 INFO L87 Difference]: Start difference. First operand 121 states and 189 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:07:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:22,661 INFO L93 Difference]: Finished difference Result 364 states and 585 transitions. [2025-01-09 11:07:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:07:22,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-01-09 11:07:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:22,665 INFO L225 Difference]: With dead ends: 364 [2025-01-09 11:07:22,665 INFO L226 Difference]: Without dead ends: 246 [2025-01-09 11:07:22,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:07:22,666 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 140 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:22,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 446 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:07:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-01-09 11:07:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 192. [2025-01-09 11:07:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 138 states have internal predecessors, (199), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 11:07:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 299 transitions. [2025-01-09 11:07:22,698 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 299 transitions. Word has length 149 [2025-01-09 11:07:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:22,699 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 299 transitions. [2025-01-09 11:07:22,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:07:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 299 transitions. [2025-01-09 11:07:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:07:22,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:22,700 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:07:22,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:07:22,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:22,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1081197999, now seen corresponding path program 1 times [2025-01-09 11:07:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:07:22,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122895622] [2025-01-09 11:07:22,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:22,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:07:22,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:07:22,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:07:22,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:22,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:07:23,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:07:23,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122895622] [2025-01-09 11:07:23,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122895622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:23,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:23,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 11:07:23,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534262097] [2025-01-09 11:07:23,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:23,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:07:23,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:07:23,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:07:23,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:07:23,602 INFO L87 Difference]: Start difference. First operand 192 states and 299 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:07:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:24,814 INFO L93 Difference]: Finished difference Result 486 states and 730 transitions. [2025-01-09 11:07:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 11:07:24,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-01-09 11:07:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:24,818 INFO L225 Difference]: With dead ends: 486 [2025-01-09 11:07:24,819 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 11:07:24,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:07:24,820 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 528 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:24,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 793 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:07:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 11:07:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 264. [2025-01-09 11:07:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.4653465346534653) internal successors, (296), 205 states have internal predecessors, (296), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 11:07:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 404 transitions. [2025-01-09 11:07:24,868 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 404 transitions. Word has length 150 [2025-01-09 11:07:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:24,869 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 404 transitions. [2025-01-09 11:07:24,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:07:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 404 transitions. [2025-01-09 11:07:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:07:24,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:24,870 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:07:24,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:07:24,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:24,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1460032298, now seen corresponding path program 1 times [2025-01-09 11:07:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:07:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219362459] [2025-01-09 11:07:24,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:07:24,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:07:24,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:07:24,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:24,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:07:28,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:07:28,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219362459] [2025-01-09 11:07:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219362459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:28,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:07:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600625413] [2025-01-09 11:07:28,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:28,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:07:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:07:28,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:07:28,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:07:28,931 INFO L87 Difference]: Start difference. First operand 264 states and 404 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:07:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:29,861 INFO L93 Difference]: Finished difference Result 665 states and 992 transitions. [2025-01-09 11:07:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 11:07:29,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-01-09 11:07:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:29,864 INFO L225 Difference]: With dead ends: 665 [2025-01-09 11:07:29,864 INFO L226 Difference]: Without dead ends: 481 [2025-01-09 11:07:29,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-01-09 11:07:29,865 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 329 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:29,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 572 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:07:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-01-09 11:07:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 354. [2025-01-09 11:07:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 284 states have (on average 1.454225352112676) internal successors, (413), 289 states have internal predecessors, (413), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:07:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 533 transitions. [2025-01-09 11:07:29,885 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 533 transitions. Word has length 150 [2025-01-09 11:07:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:29,886 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 533 transitions. [2025-01-09 11:07:29,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:07:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 533 transitions. [2025-01-09 11:07:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:07:29,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:29,887 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:07:29,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:07:29,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:29,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1461879340, now seen corresponding path program 1 times [2025-01-09 11:07:29,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:07:29,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515585098] [2025-01-09 11:07:29,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:07:29,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:07:29,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:07:29,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:29,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:07:54,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:07:54,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515585098] [2025-01-09 11:07:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515585098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:54,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:54,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:07:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162308584] [2025-01-09 11:07:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:54,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:07:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:07:54,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:07:54,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:07:54,877 INFO L87 Difference]: Start difference. First operand 354 states and 533 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:07:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:56,746 INFO L93 Difference]: Finished difference Result 461 states and 674 transitions. [2025-01-09 11:07:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 11:07:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-01-09 11:07:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:56,749 INFO L225 Difference]: With dead ends: 461 [2025-01-09 11:07:56,749 INFO L226 Difference]: Without dead ends: 459 [2025-01-09 11:07:56,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2025-01-09 11:07:56,750 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 273 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:56,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 642 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 11:07:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-09 11:07:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 356. [2025-01-09 11:07:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 286 states have (on average 1.451048951048951) internal successors, (415), 291 states have internal predecessors, (415), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:07:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 535 transitions. [2025-01-09 11:07:56,782 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 535 transitions. Word has length 150 [2025-01-09 11:07:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:56,783 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 535 transitions. [2025-01-09 11:07:56,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:07:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 535 transitions. [2025-01-09 11:07:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:07:56,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:56,784 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:07:56,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:07:56,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:56,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1718197736, now seen corresponding path program 1 times [2025-01-09 11:07:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:07:56,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344675631] [2025-01-09 11:07:56,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:07:56,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:07:56,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:07:56,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:56,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:07:59,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:07:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344675631] [2025-01-09 11:07:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344675631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:59,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:07:59,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938733240] [2025-01-09 11:07:59,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:59,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:07:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:07:59,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:07:59,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:07:59,646 INFO L87 Difference]: Start difference. First operand 356 states and 535 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:00,655 INFO L93 Difference]: Finished difference Result 481 states and 695 transitions. [2025-01-09 11:08:00,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 11:08:00,656 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-01-09 11:08:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:00,658 INFO L225 Difference]: With dead ends: 481 [2025-01-09 11:08:00,659 INFO L226 Difference]: Without dead ends: 479 [2025-01-09 11:08:00,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-01-09 11:08:00,659 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 335 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:00,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 638 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:08:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-01-09 11:08:00,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 369. [2025-01-09 11:08:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 299 states have (on average 1.4481605351170568) internal successors, (433), 304 states have internal predecessors, (433), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:08:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 553 transitions. [2025-01-09 11:08:00,679 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 553 transitions. Word has length 150 [2025-01-09 11:08:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:00,679 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 553 transitions. [2025-01-09 11:08:00,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 553 transitions. [2025-01-09 11:08:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:08:00,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:00,680 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:00,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:08:00,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:00,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1720044778, now seen corresponding path program 1 times [2025-01-09 11:08:00,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:00,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016329025] [2025-01-09 11:08:00,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:00,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:00,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:08:00,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:08:00,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:00,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:08:05,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:05,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016329025] [2025-01-09 11:08:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016329025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:05,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:05,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:08:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422579478] [2025-01-09 11:08:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:05,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:08:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:05,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:08:05,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:08:05,349 INFO L87 Difference]: Start difference. First operand 369 states and 553 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:06,938 INFO L93 Difference]: Finished difference Result 479 states and 692 transitions. [2025-01-09 11:08:06,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 11:08:06,939 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-01-09 11:08:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:06,941 INFO L225 Difference]: With dead ends: 479 [2025-01-09 11:08:06,941 INFO L226 Difference]: Without dead ends: 477 [2025-01-09 11:08:06,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-01-09 11:08:06,942 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 313 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:06,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 703 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:08:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-01-09 11:08:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 361. [2025-01-09 11:08:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 291 states have (on average 1.4536082474226804) internal successors, (423), 296 states have internal predecessors, (423), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 11:08:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 543 transitions. [2025-01-09 11:08:06,962 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 543 transitions. Word has length 150 [2025-01-09 11:08:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:06,962 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 543 transitions. [2025-01-09 11:08:06,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 543 transitions. [2025-01-09 11:08:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:08:06,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:06,963 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:06,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:08:06,964 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:06,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 438963944, now seen corresponding path program 1 times [2025-01-09 11:08:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:06,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147967864] [2025-01-09 11:08:06,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:06,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:06,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:08:06,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:08:06,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:06,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:08:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147967864] [2025-01-09 11:08:07,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147967864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:07,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:07,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:08:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147599170] [2025-01-09 11:08:07,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:07,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:08:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:07,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:08:07,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:08:07,017 INFO L87 Difference]: Start difference. First operand 361 states and 543 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:07,070 INFO L93 Difference]: Finished difference Result 809 states and 1206 transitions. [2025-01-09 11:08:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:08:07,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-01-09 11:08:07,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:07,074 INFO L225 Difference]: With dead ends: 809 [2025-01-09 11:08:07,075 INFO L226 Difference]: Without dead ends: 578 [2025-01-09 11:08:07,076 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 11:08:07,076 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 100 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:07,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 314 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:08:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-01-09 11:08:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 572. [2025-01-09 11:08:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 457 states have (on average 1.3785557986870898) internal successors, (630), 467 states have internal predecessors, (630), 98 states have call successors, (98), 16 states have call predecessors, (98), 16 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 11:08:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 826 transitions. [2025-01-09 11:08:07,118 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 826 transitions. Word has length 150 [2025-01-09 11:08:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:07,118 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 826 transitions. [2025-01-09 11:08:07,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 826 transitions. [2025-01-09 11:08:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:08:07,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:07,120 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:07,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:08:07,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:07,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:07,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1140028522, now seen corresponding path program 1 times [2025-01-09 11:08:07,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:07,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11028757] [2025-01-09 11:08:07,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:07,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:07,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:08:07,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:08:07,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:07,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:08:07,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:07,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11028757] [2025-01-09 11:08:07,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11028757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:07,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:07,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:08:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590647788] [2025-01-09 11:08:07,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:07,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:08:07,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:07,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:08:07,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:08:07,190 INFO L87 Difference]: Start difference. First operand 572 states and 826 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:07,390 INFO L93 Difference]: Finished difference Result 1289 states and 1830 transitions. [2025-01-09 11:08:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:08:07,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-01-09 11:08:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:07,396 INFO L225 Difference]: With dead ends: 1289 [2025-01-09 11:08:07,396 INFO L226 Difference]: Without dead ends: 904 [2025-01-09 11:08:07,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:08:07,399 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 99 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:07,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 394 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:08:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-01-09 11:08:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 776. [2025-01-09 11:08:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 623 states have (on average 1.3723916532905296) internal successors, (855), 636 states have internal predecessors, (855), 130 states have call successors, (130), 22 states have call predecessors, (130), 22 states have return successors, (130), 117 states have call predecessors, (130), 130 states have call successors, (130) [2025-01-09 11:08:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1115 transitions. [2025-01-09 11:08:07,449 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1115 transitions. Word has length 150 [2025-01-09 11:08:07,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:07,449 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1115 transitions. [2025-01-09 11:08:07,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1115 transitions. [2025-01-09 11:08:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:08:07,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:07,451 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:07,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:08:07,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:07,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1398193960, now seen corresponding path program 1 times [2025-01-09 11:08:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781863473] [2025-01-09 11:08:07,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:07,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:08:07,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:08:07,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:07,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:08:09,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781863473] [2025-01-09 11:08:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781863473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:09,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:09,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 11:08:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181028046] [2025-01-09 11:08:09,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:09,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 11:08:09,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:09,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 11:08:09,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:08:09,192 INFO L87 Difference]: Start difference. First operand 776 states and 1115 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:10,452 INFO L93 Difference]: Finished difference Result 1011 states and 1402 transitions. [2025-01-09 11:08:10,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:08:10,453 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-01-09 11:08:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:10,457 INFO L225 Difference]: With dead ends: 1011 [2025-01-09 11:08:10,457 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 11:08:10,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-01-09 11:08:10,458 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 231 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:10,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 715 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:08:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 11:08:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 842. [2025-01-09 11:08:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 678 states have (on average 1.3569321533923304) internal successors, (920), 693 states have internal predecessors, (920), 138 states have call successors, (138), 25 states have call predecessors, (138), 25 states have return successors, (138), 123 states have call predecessors, (138), 138 states have call successors, (138) [2025-01-09 11:08:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1196 transitions. [2025-01-09 11:08:10,518 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1196 transitions. Word has length 150 [2025-01-09 11:08:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:10,518 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1196 transitions. [2025-01-09 11:08:10,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1196 transitions. [2025-01-09 11:08:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 11:08:10,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:10,520 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:10,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:08:10,521 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:10,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:10,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1400041002, now seen corresponding path program 1 times [2025-01-09 11:08:10,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:10,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475121537] [2025-01-09 11:08:10,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:10,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:10,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 11:08:10,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 11:08:10,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:10,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:08:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475121537] [2025-01-09 11:08:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475121537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:13,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:08:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370261270] [2025-01-09 11:08:13,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:13,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:08:13,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:13,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:08:13,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:08:13,677 INFO L87 Difference]: Start difference. First operand 842 states and 1196 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:15,041 INFO L93 Difference]: Finished difference Result 943 states and 1322 transitions. [2025-01-09 11:08:15,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:08:15,042 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-01-09 11:08:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:15,046 INFO L225 Difference]: With dead ends: 943 [2025-01-09 11:08:15,046 INFO L226 Difference]: Without dead ends: 941 [2025-01-09 11:08:15,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:08:15,047 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 288 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:15,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 666 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:08:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-01-09 11:08:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 842. [2025-01-09 11:08:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 678 states have (on average 1.3569321533923304) internal successors, (920), 693 states have internal predecessors, (920), 138 states have call successors, (138), 25 states have call predecessors, (138), 25 states have return successors, (138), 123 states have call predecessors, (138), 138 states have call successors, (138) [2025-01-09 11:08:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1196 transitions. [2025-01-09 11:08:15,101 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1196 transitions. Word has length 150 [2025-01-09 11:08:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:15,101 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1196 transitions. [2025-01-09 11:08:15,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1196 transitions. [2025-01-09 11:08:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:08:15,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:15,103 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:15,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:08:15,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:15,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash 543557726, now seen corresponding path program 1 times [2025-01-09 11:08:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:15,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768557660] [2025-01-09 11:08:15,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:15,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:08:15,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:08:15,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:15,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 11:08:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768557660] [2025-01-09 11:08:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768557660] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:08:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444541148] [2025-01-09 11:08:15,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:15,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:08:15,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:08:15,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 11:08:15,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:08:15,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:08:15,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:15,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:15,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 11:08:15,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 301 proven. 51 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 11:08:15,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:08:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 11:08:15,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444541148] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:08:15,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:08:15,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 11:08:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016517498] [2025-01-09 11:08:15,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:08:15,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:08:15,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:15,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:08:15,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:08:15,590 INFO L87 Difference]: Start difference. First operand 842 states and 1196 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2025-01-09 11:08:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:15,815 INFO L93 Difference]: Finished difference Result 1188 states and 1663 transitions. [2025-01-09 11:08:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:08:15,816 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 151 [2025-01-09 11:08:15,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:15,819 INFO L225 Difference]: With dead ends: 1188 [2025-01-09 11:08:15,819 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 11:08:15,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:08:15,820 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 61 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:15,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 386 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:08:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 11:08:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 558. [2025-01-09 11:08:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 419 states have (on average 1.2458233890214798) internal successors, (522), 428 states have internal predecessors, (522), 114 states have call successors, (114), 24 states have call predecessors, (114), 24 states have return successors, (114), 105 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 11:08:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 750 transitions. [2025-01-09 11:08:15,865 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 750 transitions. Word has length 151 [2025-01-09 11:08:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:15,865 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 750 transitions. [2025-01-09 11:08:15,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2025-01-09 11:08:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 750 transitions. [2025-01-09 11:08:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:08:15,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:15,866 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:15,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 11:08:16,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:16,071 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:16,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1337331430, now seen corresponding path program 1 times [2025-01-09 11:08:16,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:16,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92348529] [2025-01-09 11:08:16,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:16,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:08:16,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:08:16,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:16,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:08:19,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:19,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92348529] [2025-01-09 11:08:19,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92348529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:19,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:19,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:08:19,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984036099] [2025-01-09 11:08:19,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:19,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:08:19,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:19,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:08:19,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:08:19,979 INFO L87 Difference]: Start difference. First operand 558 states and 750 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:21,488 INFO L93 Difference]: Finished difference Result 692 states and 904 transitions. [2025-01-09 11:08:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 11:08:21,489 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 11:08:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:21,492 INFO L225 Difference]: With dead ends: 692 [2025-01-09 11:08:21,492 INFO L226 Difference]: Without dead ends: 690 [2025-01-09 11:08:21,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-01-09 11:08:21,495 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 264 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:21,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 585 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:08:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-01-09 11:08:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 568. [2025-01-09 11:08:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 429 states have (on average 1.2447552447552448) internal successors, (534), 438 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 24 states have return successors, (114), 105 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 11:08:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 762 transitions. [2025-01-09 11:08:21,542 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 762 transitions. Word has length 151 [2025-01-09 11:08:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:21,542 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 762 transitions. [2025-01-09 11:08:21,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:21,543 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 762 transitions. [2025-01-09 11:08:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:08:21,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:21,544 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:21,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 11:08:21,544 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:21,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1335484388, now seen corresponding path program 1 times [2025-01-09 11:08:21,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:21,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16423337] [2025-01-09 11:08:21,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:21,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:21,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:08:21,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:08:21,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:21,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:08:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:46,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16423337] [2025-01-09 11:08:46,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16423337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:46,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:46,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:08:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776427682] [2025-01-09 11:08:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:46,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:08:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:46,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:08:46,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:08:46,051 INFO L87 Difference]: Start difference. First operand 568 states and 762 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:48,747 INFO L93 Difference]: Finished difference Result 684 states and 895 transitions. [2025-01-09 11:08:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 11:08:48,748 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 11:08:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:48,750 INFO L225 Difference]: With dead ends: 684 [2025-01-09 11:08:48,751 INFO L226 Difference]: Without dead ends: 682 [2025-01-09 11:08:48,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2025-01-09 11:08:48,751 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 253 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:48,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 602 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 11:08:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-01-09 11:08:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 553. [2025-01-09 11:08:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 414 states have (on average 1.2415458937198067) internal successors, (514), 423 states have internal predecessors, (514), 114 states have call successors, (114), 24 states have call predecessors, (114), 24 states have return successors, (114), 105 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 11:08:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 742 transitions. [2025-01-09 11:08:48,818 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 742 transitions. Word has length 151 [2025-01-09 11:08:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:48,818 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 742 transitions. [2025-01-09 11:08:48,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 742 transitions. [2025-01-09 11:08:48,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:08:48,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:48,819 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:48,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 11:08:48,819 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:48,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:48,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2012285605, now seen corresponding path program 1 times [2025-01-09 11:08:48,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:48,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003870086] [2025-01-09 11:08:48,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:48,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:48,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:08:48,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:08:48,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:48,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 11:08:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003870086] [2025-01-09 11:08:48,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003870086] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:08:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304130561] [2025-01-09 11:08:48,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:48,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:48,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:08:48,913 INFO L229 MonitoredProcess]: Starting monitored process 4 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 11:08:48,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 11:08:48,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:08:48,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:08:48,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:48,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:48,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:08:49,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-01-09 11:08:49,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:08:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 11:08:49,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304130561] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:08:49,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:08:49,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 11:08:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248071222] [2025-01-09 11:08:49,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:08:49,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:08:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:49,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:08:49,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:08:49,236 INFO L87 Difference]: Start difference. First operand 553 states and 742 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-01-09 11:08:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:49,404 INFO L93 Difference]: Finished difference Result 1063 states and 1413 transitions. [2025-01-09 11:08:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:08:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 151 [2025-01-09 11:08:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:49,408 INFO L225 Difference]: With dead ends: 1063 [2025-01-09 11:08:49,408 INFO L226 Difference]: Without dead ends: 577 [2025-01-09 11:08:49,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:08:49,409 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 170 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:49,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 211 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:08:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-01-09 11:08:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 569. [2025-01-09 11:08:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 426 states have (on average 1.227699530516432) internal successors, (523), 435 states have internal predecessors, (523), 114 states have call successors, (114), 28 states have call predecessors, (114), 28 states have return successors, (114), 105 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 11:08:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 751 transitions. [2025-01-09 11:08:49,454 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 751 transitions. Word has length 151 [2025-01-09 11:08:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:49,454 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 751 transitions. [2025-01-09 11:08:49,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-01-09 11:08:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 751 transitions. [2025-01-09 11:08:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:08:49,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:49,455 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:49,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 11:08:49,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:49,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:49,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash 323341863, now seen corresponding path program 1 times [2025-01-09 11:08:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:49,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374312220] [2025-01-09 11:08:49,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:49,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:49,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:08:49,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:08:49,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:49,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:08:49,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:49,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374312220] [2025-01-09 11:08:49,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374312220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:49,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:49,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:08:49,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060175164] [2025-01-09 11:08:49,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:49,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:08:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:49,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:08:49,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:08:49,859 INFO L87 Difference]: Start difference. First operand 569 states and 751 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:50,179 INFO L93 Difference]: Finished difference Result 1079 states and 1423 transitions. [2025-01-09 11:08:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:08:50,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-01-09 11:08:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:50,186 INFO L225 Difference]: With dead ends: 1079 [2025-01-09 11:08:50,186 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 11:08:50,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:08:50,188 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 102 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:50,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 378 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:08:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 11:08:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 569. [2025-01-09 11:08:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 425 states have (on average 1.2211764705882353) internal successors, (519), 434 states have internal predecessors, (519), 114 states have call successors, (114), 29 states have call predecessors, (114), 29 states have return successors, (114), 105 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 11:08:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 747 transitions. [2025-01-09 11:08:50,234 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 747 transitions. Word has length 151 [2025-01-09 11:08:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:50,234 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 747 transitions. [2025-01-09 11:08:50,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:08:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 747 transitions. [2025-01-09 11:08:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 11:08:50,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:50,235 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:50,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 11:08:50,236 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:50,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash -509367638, now seen corresponding path program 1 times [2025-01-09 11:08:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:50,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635439641] [2025-01-09 11:08:50,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:50,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:08:50,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:08:50,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:50,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 11:08:50,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:50,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635439641] [2025-01-09 11:08:50,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635439641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:08:50,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341928329] [2025-01-09 11:08:50,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:50,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:50,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:08:50,340 INFO L229 MonitoredProcess]: Starting monitored process 5 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 11:08:50,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 11:08:50,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 11:08:50,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 11:08:50,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:50,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:50,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 11:08:50,429 INFO L279 TraceCheckSpWp]: Computing forward predicates...